No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
TEECH-ME: Threshold sensitive Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol for WSNs
Abstract
In this paper, we propose Threshold sensitive Energy Efficient Cluster Heads based on Maximum Energy (TEECH-ME) routing protocol for Wireless Sensor Networks (WSNs). The main objective of this technique is to improve lifetime and stability period of network by applying threshold limitations on nodes deployed in static clusters. In our propose scheme, nodes with maximum energy become CHs of their regions. In TEECH-ME, we use threshold sensitivity parameters in network operation that limit the transmissions of whole network. We also apply Uniform Random Model to find out the drooped packets to make our protocol more practical. Simulation results show that our technique is 40% better than REECH-ME in terms of network lifetime.
... To reduce the energy consumption of a node, the deployment of sensor nodes plays a significant role. It minimizes the energy-hole creation problem [2]. If an energy-hole is created, the energy of the network is consumed hastily due to the unbalance load of data transmission. ...
... To overcome the long distance multi-hop communication, authors of Regional Energy Efficient Cluster Heads based on Maximal Energy (REECH-ME) [4] divide the field into small rectangular regions and select CH on the basis of maximum residual energy to outperform LEACH. However, it fails to address the energy hole to a greater extent. ...
Energy Hole is the major problem in the effi-ciency of Wireless Sensor Networks (WSNs). A routing protocol MASEHA : Multi-hop communication using Active and Sleep nodes for Energy Hole Avoidance is proposed in this research paper to overcome the energy hole problem. Taking the concept of Active and sleep mode of nodes, we propose that the network is divided into active and sleep nodes. Half of the sleep nodes are turned on when the first node dies and remaining sleep nodes are activated after the death of tenth node. We have achieved balanced stability, increased sensing period of nodes and balanced energy consumption. Further, MASEHA uses dynamic clustering, divides the network into small sub-areas and uses uniform number of CHs throughout the network. Selection of CHs is done on the basis of maximum energy and minimum distance multi-hop communication is utilized in our paper. Simulation results show that these aspects help in out performing our proposed protocol with the existing protocols.
In this paper, we propose Regional Energy Efficient Cluster Heads based on Maximum Energy (REECH-ME) Routing Protocol for Wireless Sensor Networks (WSNs). The main purpose of this protocol is to improve the network lifetime and particularly the stability period of the network. In REECH-ME, the node with the maximum energy in a region becomes Cluster Head (CH) of that region for that particular round and the number of the cluster heads in each round remains the same. Our technique outperforms LEACH [1] which uses probabilistic approach for the selection of CHs. We also implement the Uniform Random Distribution Model to find the packet drop to make this protocol more practical. We also calculate the confidence interval of all our results which helps us to visualize the possible deviation of our graphs from the mean value.
Wireless Sensor Networks (WSNs) with their dynamic applications gained a tremendous attention of researchers. Constant monitoring of critical situations attracted researchers to utilize WSNs at vast platforms. The main focus in WSNs is to enhance network life-time as much as one could, for efficient and optimal utilization of resources. Different approaches based upon clustering are proposed for optimum functionality. Network life-time is always related with energy of sensor nodes deployed at remote areas for constant and fault tolerant monitoring. In this work, we propose Quadrature-LEACH (Q-LEACH) for homogenous networks which enhances stability period, network life-time and throughput quiet significantly.
One of the major challenges in design of wireless sensor networks (WSNs) is to reduce energy consumption of sensor nodes to prolong lifetime of finite capacity batteries. In this paper, we propose energy-efficient adaptive scheme for transmission (EAST) in WSNs. EAST is an IEEE 802.15.4 standard compliant. In this scheme, open-looping feedback process is used for temperature-aware link quality estimation and compensation, wherea closed-loop feedback process helps to divide network into three logical regions to minimize overhead of control packets. Threshold on transmitter power loss () and current number of nodes (()) in each region help to adapt transmit power level () according to link quality changes due to temperature variation. Evaluation of the proposed scheme is done by considering
mobile sensor nodes and reference node both static and mobile. Simulation results show that the proposed scheme effectively adapts transmission to changing link quality with less control packets overhead and energy consumption as compared to classical approach with single region in which maximum transmitter assigned to compensate temperature variation.
We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources—this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We also assume that the sensors are randomly (uniformly) distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. We show that the behavior of such sensor networks becomes very unstable once the first node dies, especially in the presence of node heterogeneity. Classical clustering protocols assume that all the nodes are equipped with the same amount of energy and as a result, they can not take full advantage of the presence of node heterogeneity. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes.
Wireless Sensor Networks (WSNs) with their dynamic applications gained a tremendous attention of researchers. Constant monitoring of critical situations attracted researchers to utilize WSNs at vast platforms. The main focus in WSNs is to enhance network life-time as much as one could, for efficient and optimal utilization of resources. Different approaches based upon clustering are proposed for optimum functionality. Network life-time is always related with energy of sensor nodes deployed at remote areas for constant and fault tolerant monitoring. In this work, we propose Quadrature-LEACH (Q-LEACH) for homogenous networks which enhances stability period, network life-time and throughput quiet significantly.
In order to prolong the network lifetime, energy-efficient protocols should be designed to adapt the characteristic of wireless sensor networks. Clustering Algorithm is a kind of key technique used to reduce energy consumption, which can increase network scalability and lifetime. This paper studies the performance of clustering algorithm in saving energy for heterogeneous wireless sensor networks. A new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks is proposed and evaluated. In the new clustering scheme, cluster-heads are elected by a probability based on the ratio between residual energy of node and the average energy of network. The high initial and residual energy nodes will have more chances to be the cluster-heads than the low energy nodes. Simulational results show that the clustering scheme provides longer lifetime and higher throughput than the current important clustering protocols in heterogeneous environments.
Wireless Sensor Networks (WSNs) consist of large number of randomly
deployed energy constrained sensor nodes. Sensor nodes have ability to
sense and send sensed data to Base Station (BS). Sensing as well as
transmitting data towards BS require high energy. In WSNs, saving energy
and extending network lifetime are great challenges. Clustering is a key
technique used to optimize energy consumption in WSNs. In this paper, we
propose a novel clustering based routing technique: Enhanced Developed
Distributed Energy Efficient Clustering scheme (EDDEEC) for
heterogeneous WSNs. Our technique is based on changing dynamically and
with more efficiency the Cluster Head (CH) election probability.
Simulation results show that our proposed protocol achieves longer
lifetime, stability period and more effective messages to BS than
Distributed Energy Efficient Clustering (DEEC), Developed DEEC (DDEEC)
and Enhanced DEEC (EDEEC) in heterogeneous environments.
In this paper, we propose Regional Energy Efficient Cluster Heads based on
Maximum Energy (REECH-ME) Routing Protocol for Wireless Sensor Networks (WSNs)
. The main purpose of this protocol is to improve the network lifetime and
particularly the stability period of the network. In REECH-ME, the node with
the maximum energy in a region becomes Cluster Head (CH) of that region for
that particular round and the number of the cluster heads in each round remains
the same. Our technique outperforms LEACH which uses probabilistic approach for
the selection of CHs. We also implement the Uniform Random Distribution Model
to find the packet drop to make this protocol more practical. We also calculate
the confidence interval of all our results which helps us to visualize the
possible deviation of our graphs from the mean value.
In wireless sensor networks, the number of sensor nodes has direct relation to the cost of total wireless sensor networks, and at the same time, the problem is closely connected to wireless sensor networks' performance, such as robust, fault-tolerance, and furthermore, it is considered at first as wireless sensor networks are designed. Therefore, the research on the number of sensor nodes has significant meanings of theory and practice to design of wireless sensor networks. By computation and analysis, the sensor deployments in the form of equilateral triangle, as a rule, are better than those in the form of square, and the efficient coverage area ratios decrease with increasing number of sensor nodes. Sometime information is incompletely monitored or undetected. This is coverage and connectivity problems. The coverage problem is also one of basic problem in wireless sensor networks. The paper analyzes several sensor deployments and computes their efficient coverage areas and their efficient coverage area ratios. In addition, the relation between the number of sensors and efficient coverage area ratio is discussed.
Wireless Sensor Networks (WSNs) consist of numerous sensors which send
sensed data to base station. Energy conservation is an important issue
for sensor nodes as they have limited power.Many routing protocols have
been proposed earlier for energy efficiency of both homogeneous and
heterogeneous environments. We can prolong our stability and network
lifetime by reducing our energy consumption. In this research paper, we
propose a protocol designed for the characteristics of a reactive
homogeneous WSNs, HEER (Hybrid Energy Efficient Reactive) protocol. In
HEER, Cluster Head(CH) selection is based on the ratio of residual
energy of node and average energy of network. Moreover, to conserve more
energy, we introduce Hard Threshold (HT) and Soft Threshold (ST).
Finally, simulations show that our protocol has not only prolonged the
network lifetime but also significantly increased stability period.
Wireless Sensor Networks (WSNs) are expected to find wide applicability and
increasing deployment in near future. In this paper, we propose a new protocol,
Threshold Sensitive Stable Election Protocol (TSEP), which is reactive protocol
using three levels of heterogeneity. Reactive networks, as opposed to proactive
networks, respond immediately to changes in relevant parameters of interest. We
evaluate performance of our protocol for a simple temperature sensing
application and compare results of protocol with some other protocols LEACH,
DEEC, SEP, ESEP and TEEN. And from simulation results it is observed that
protocol outperforms concerning life time of sensing nodes used.
Wireless Local Area Network (WLAN) has progressed quickly and found its wide applications recently because of mobility, flexibility, extensible and low cost. WLAN has become very important part of future communication. Quality of Service is a hot-point of research about wireless network. Two wireless network loss models, namely random uniformed model and Gilbert-Elliott model, are analyzed. The theoretic results were verified by simulation empirical results. The applications of both models are therefore proved.
Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
The clustering Algorithm is a kind of key technique used to reduce energy consumption. It can increase the scalability and lifetime of the network. Energy-efficient clustering protocols should be designed for the characteristic of heterogeneous wireless sensor networks. We propose and evaluate a new distributed energy-efficient clustering scheme for heterogeneous wireless sensor networks, which is called DEEC. In DEEC, the cluster-heads are elected by a probability based on the ratio between residual energy of each node and the average energy of the network. The epochs of being cluster-heads for nodes are different according to their initial and residual energy. The nodes with high initial and residual energy will have more chances to be the cluster-heads than the nodes with low energy. Finally, the simulation results show that DEEC achieves longer lifetime and more effective messages than current important clustering protocols in heterogeneous environments.
In recent years there has been a growing interest in wireless sensor networks (WSN) applications. Such sensor networks can be used to control temperature, humidity, contamination, pollution etc. Self-organization and routing algorithms dedicated to wireless sensor networks usually assume that sensors absolute positions are unknown and all decisions are based on sensor's own local information. This assumption makes wireless sensor networks more flexible and energy conserve because making decisions locally is faster and energy efficient. But sooner or later sensors positions have to be found (when sensor sends a message about some event we of course would like to know where this event takes place). In this paper we describe different solutions of finding transceivers positions in wireless networks and we discuss localization in wireless sensor networks. We propose to transfer localization function from base stations to every sensor. We evaluate presented method using simulations
Energy efficient communication protocol for wireless microsensor networks
- W R Heinzelman
- A Chandrakasan
- H Balakrishnan
W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy
efficient communication protocol for wireless microsensor networks",
Proceedings of the 33rd Hawaii International Conference on System
Sciences (HICSS-33), p. 10, 2000.
An efficient approach for sensor deployments in wireless sensor network
- N Akshay
- M P Kumar
- B Harish
- S Dhonarkar
N. Akshay, M. P. Kumar, B. Harish, and S. Dhonarkar, "An efficient
approach for sensor deployments in wireless sensor network", 2010
International Conference on Emerging Trends in Robotics and Communication Technologies (INTERACT), pp. 350-355, 2010.
A solution to error and loss in wireless network transfer
- Q Zhou
- X Cao
- S Chen
- G Lin
Q. Zhou, X. Cao, S. Chen, and G. Lin, "A solution to error and loss
in wireless network transfer", International Conference on Wireless
Networks and Information Systems, WNIS'09, pp. 312-315, 2009.
TSEP: Thresholdsensitive Stable Election Protocol for WSNs
- A Kashaf
- N Javaid
- Z A Khan
- I A Khan
A. Kashaf, N. Javaid, Z. A. Khan, and I. A. Khan, "TSEP: Thresholdsensitive Stable Election Protocol for WSNs", 10th International Conference on Frontiers of Information Technology (FIT), pp. 164-168, 2012.