Trilok C. Aseri

EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor networks

Abstract In recent years, there has been a growing interest in wireless sensor networks. One of the major issues in wireless sensor network is developing an energy-efficient clustering protocol. Hierarchical clustering algorithms are very important in increasing the network’s life time. Each clustering algorithm is composed of two phases, the setup phase and steady state phase. The hot point in these algorithms is the cluster head selection. In this paper, we study the impact of heterogeneity of nodes in terms of their energy in wireless sensor networks that are hierarchically clustered. We assume that a percentage of the population of sensor nodes is equipped with the additional energy resources. We also assume that the sensor nodes are randomly distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. Homogeneous clustering protocols assume that all the sensor nodes are equipped with the same amount of energy and as a result, they cannot take the advantage of the presence of node heterogeneity. Adapting this approach, we introduce an energy efficient heterogeneous clustered scheme for wireless sensor networks based on weighted election probabilities of each node to become a cluster head according to the residual energy in each node. Finally, the simulation results demonstrate that our proposed heterogeneous clustering approach is more effective in prolonging the network lifetime compared with LEACH.

Multi-hop communication routing (MCR) protocol for heterogeneous wireless sensor networks

Effective energy management in heterogeneous wireless sensor networks (WSNs) is a more challenging issue compared to homogeneous WSNs. Much of the existing research has often assumed homogeneous sensor nodes in the networks. The energy preservation schemes for the homogeneous WSNs do not perform efficiently when applied to heterogeneous WSNs. In this paper, we have presented an energy-efficient multi-hop communication routing (MCR) protocol in order to address the traditional problem of load balancing, lifetime, stability and energy efficiency in the WSNs. MCR protocol is based on dividing the network into dynamic clusters. The cluster-heads election is based on weighted probability. The clusters nodes communicate with an elected cluster head node by using single hop communication approach, and then the cluster heads communicate the information to the base station via multi-hop communication approach. Performance studies indicate that MCR effectively solves the problem of load balancing across the network, extends the network lifetime, stability and is more energy efficient in comparison to multi-hop low-energy adaptive clustering hierarchy (M-LEACH) and multilayer energy efficient cluster head communication protocol (MEECHCP).

EECHE: energy-efficient cluster head election protocol for heterogeneous wireless sensor networks

A wireless sensor network with a large number of tiny sensor nodes can be used as an effective tool for gathering data in various situations. One of the major issues in wireless sensor network is developing an energy-efficient routing protocol which has a significant impact on the overall lifetime and stability of the sensor network. Clustering sensor nodes is an effective technique in wireless sensor networks which can increase network energy efficiency, scalability and lifetime. In this paper, we have considered three types of sensor nodes. Some fraction of the sensor nodes are equipped with the additional energy resources than the other nodes. We have assumed that all the sensor nodes are uniformly distributed. Adapting this approach, we have developed an energy efficient cluster head election (EECHE) protocol for heterogeneous wireless sensor networks to extend the network lifetime and stability, which is crucial for many applications. Simulations results demonstrated that EECHE is able to prolong the time interval of the death of first node in the sensor filed that enhances the system lifetime and stability over the existing protocols.

Computational Disease Gene Prioritization: An Appraisal

Bioinformatics aids in the understanding of the biological processes of living beings and the genetic architecture of human diseases. The discovery of disease-related genes improves the diagnosis and therapy design for the disease. To save the cost and time involved in the experimental verification of the candidate genes, computational methods are employed for ranking the genes according to their likelihood of being associated with the disease. Only top-ranked genes are then verified experimentally. A variety of methods have been conceived by the researchers for the prioritization of the disease candidate genes, which differ in the data source being used or the scoring function used for ranking the genes. A review of various aspects of computational disease gene prioritization and its research issues is presented in this article. The aspects covered are gene prioritization process, data sources used, types of prioritization methods, and performance assessment methods. This article provides a brief overview and acts as a quick guide for disease gene prioritization.

A comparative analysis of soft computing techniques for gene prediction.

The rapid growth of genomic sequence data for both human and nonhuman species has made analyzing these sequences, especially predicting genes in them, very important and is currently the focus of many research efforts. Beside its scientific interest in the molecular biology and genomics community, gene prediction is of considerable importance in human health and medicine. A variety of gene prediction techniques have been developed for eukaryotes over the past few years. This article reviews and analyzes the application of certain soft computing techniques in gene prediction. First, the problem of gene prediction and its challenges are described. These are followed by different soft computing techniques along with their application to gene prediction. In addition, a comparative analysis of different soft computing techniques for gene prediction is given. Finally some limitations of the current research activities and future research directions are provided.

A Review of Soft Computing Techniques for Gene Prediction

In the past decade, various genomes have been sequenced in both plants and animals. The falling cost of genome sequencing manifests a great impact on the research community with respect to annotation of genomes. Genome annotation helps in understanding the biological functions of the sequences of these genomes. Gene prediction is one of the most important aspects of genome annotation and it is an open research problem in bioinformatics. A large number of techniques for gene prediction have been developed over the past few years. In this paper a theoretical review of soft computing techniques for gene prediction is presented. The problem of gene prediction, along with the issues involved in it, is first described. A brief description of soft computing techniques, before discussing their application to gene prediction, is then provided. In addition, a list of different soft computing techniques for gene prediction is compiled. Finally some limitations of the current research and future research directions are presented.

A Comparative Analysis of Reliable and Congestion-Aware Transport Layer Protocols for Wireless Sensor Networks

Design and implementation of wireless sensor Networks have gathered increased attention in recent years due to vast potential of sensor networks consisting of spatially distributed devices (motes) to cooperatively monitor physical or environmental conditions at different locations. Wireless sensor networks are built upon low cost nodes with limited battery (power), CPU clock (processing capacity), and memory modules (storage). Transport layer protocols applied to wireless sensor networks can handle the communications between the sink node and sensor nodes in upstream (sensor-to-sink) or downstream (sink-to-sensor) direction. In this paper, we present a comparative analysis of reliable and congestion aware transport layer protocols for wireless sensor networks and number of open issues that have to be carefully realized to make use of the wireless sensor networks more efficiently and to enhance their performance. We first list the characteristics of transport layer protocols. We then provide a summary of reliable and congestion aware transport layer protocols with their respective pros and cons and comparison of different protocols based on reliability, congestion control, and energy efficiency. Finally, we point out open research issues of transport layer protocols for wireless sensor networks, which need further attention to overcome the earlier mentioned challenges.

An improved transport layer protocol for wireless sensor networks

Wireless sensor networks (WSNs) are a kind of communication networks having independent sensor nodes that form multi-hop ad hoc network to transfer data. In the past few years, various transport control protocols in wireless sensor networks (WSNs) have been developed and proposed in the literature. In this paper, we have analyzed pump slowly, fetch quickly (PSFQ) protocol and presented an improved transport layer protocol for wireless sensor networks. The improved protocol has been analyzed based on various factors such as average latency and average error tolerance and it is found that the proposed protocol is better than PSFQ in terms of these factors.

Comparison of routing protocols in wireless sensor network using mobile sink- A survey

Wireless sensor network consists of various sensor nodes which sense the environment and forward the sensed data to the sink node. Routing in static wireless sensor network sensor nodes near the sink consume all its energy there by network partition occurs (hot-spot problem). To avoid hot-spot problem a routing in wireless sensor network using mobile sink can be used, where a sink node is provided mobility which gathers information from the sensor nodes using 1-hop communication there by reduces a hot-spot problem and increases network lifetime and decreases energy consumption. In this paper types of wireless sensor network are presented, various routing protocols in wireless sensor network using mobile sink is also presented. At the end of the paper a detailed comparison of surveyed routing protocols is also presented.

A hybrid and dynamic reliable transport protocol for wireless sensor networks

Display Omitted A hybrid and dynamic reliable transport protocol for wireless sensor networks is proposed.It provides hybrid Acknowledgement/Negative Acknowledgement scheme.It controls the booting sensor nodes problem and the all-packets-lost problem.The performance of proposed protocol is tested under TinyOS Simulator. Wireless sensor networks are formed by a large number of sensor nodes which are commonly known as motes. In the past few years, several reliable, congestion controlled and energy efficient transport layer protocols in wireless sensor networks have been developed and proposed in the literature. In this paper, we have presented a hybrid and dynamic reliable transport protocol which provides the mechanism to dynamically assign the timing parameters to the nodes as well as enhance the protocol performance by using a hybrid Acknowledgement/Negative Acknowledgement scheme. The performance of proposed protocol is tested under TinyOS Simulator varying different parameters and protocol settings and found that proposed protocol is able to program all the nodes when given proper pump/fetch ratios, is able to solve the booting sensor nodes problem by being able to wait till all the nodes finished booting and solves the all-packets-lost problem by acknowledging the receipt of its first packet delivered that is the inform message.