Wireless sensor networks hierarchical routing algorithm based on node's energy balance

2011 ◽  
Author(s):  
Fan yan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Hierarchical Routing

scholarly journals Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

scholarly journals An Energy-Balanced Mechanism for Hierarchical Routing in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zhenjiang Zhang ◽  
Yanan Wang ◽  
Fuxing Song ◽  
Wenyu Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Hierarchical Routing ◽  
Cluster Heads

In wireless sensor networks (WSNs), energy-constrained sensor nodes are always deployed in hazardous and inaccessible environments, making energy management a key problem for network design. The mechanism of RNTA (redundant node transmission agents) lacks an updating mechanism for the redundant nodes, causing an unbalanced energy distribution among sensor nodes. This paper presents an energy-balanced mechanism for hierarchical routing (EBM-HR), in which the residual energy of redundant nodes is quantified and made hierarchic, so that the cluster head can dynamically select the redundant node with the highest residual energy grade as a relay to complete the information transmission to the sink node and achieve an intracluster energy balance. In addition, the network is divided into several layers according to the distances between cluster heads and the sink node. Based on the energy consumption of the cluster heads, the sink node will decide to recluster only in a certain layer so as to achieve an intercluster energy balance. Our approach is evaluated by a simulation comparing the LEACH algorithm to the HEED algorithm. The results demonstrate that the BEM-HR mechanism can significantly boost the performance of a network in terms of network lifetime, data transmission quality, and energy balance.

scholarly journals EBDHR: Energy Balancing and Dynamic Hierarchical Routing algorithm for wireless sensor networks

2010 ◽  
Vol 7 (15) ◽  
pp. 1112-1118 ◽  
Author(s):  
Saeed Rasouli Heikalabad ◽  
Ahmad Habibizad Navin ◽  
Mirkamal Mirnia ◽  
Saeed Ebadi ◽  
Mehdi Golesorkhtabar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
Energy Balancing ◽  
Hierarchical Routing

Hierarchical Routing Algorithm for Wireless Sensor Network

2013 ◽  
Vol 427-429 ◽  
pp. 2416-2419 ◽  
Author(s):  
Liang Huang ◽  
Mei Wang ◽  
Jing Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Main Idea ◽  
Wireless Sensor ◽  
Level Energy ◽  
Cluster Number ◽  
Hierarchical Routing ◽  
Energy Estimation ◽  
Heterogeneous Wireless Sensor Networks

Aiming at the deficiency in the hierarchical routing algorithm, an improved routing algorithm of ring based multi-hop clustering (IRBMC) is developed. The main idea of IRBMC is to divide wireless sensor networks field into heterogeneous spacing rings to control the cluster number and build unequal size of clusters in different rings. To ensure the higher energy level nodes having more chance to become cluster head, the improved average residual energy estimation is used to determine the probability of nodes in each ring to be the cluster heads. Simulation results illustrate that IRBMC has a better result in prolonging the lifetime of network with the multi-level energy than the stable election protocol (SEP) for clustered heterogeneous wireless sensor networks, the low-energy adaptive clustering hierarchy (LEACH), and the ring based multi-hop clustering (RBMC) algorithm. The lifetime of IRBMC is 1.14 times of SEP, 1.57 times of LEACH, and 1.6 times of RBMC.

Sign in / Sign up

Export Citation Format

Share Document