scholarly journals K-CHRA: A Clustering Hierarchical Routing Algorithm for Wireless Rechargeable Sensor Networks

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 81859-81874 ◽  
Author(s):  
Zhenchun Wei ◽  
Fei Liu ◽  
Xu Ding ◽  
Lin Feng ◽  
Zengwei Lyu ◽  
...  
Keyword(s):  
Sensor Networks ◽  
Routing Algorithm ◽  
Hierarchical Routing ◽  
Wireless Rechargeable Sensor Networks

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