Paper Info
Title
Energy-Balanced Unequal Clustering Routing Algorithm for Wireless Sensor Networks.
Abstract
In wireless sensor networks (WSNs), the clustering routing technology can improve the scalability of the network. When the cluster head transmits data to the base station in a multi hop manner, the residual energy of cluster head and path condition are not considered. So it can reduce the lifetime of cluster head and seriously affect the network lifetime. We propose an energy-balanced unequal clustering routing algorithm for wireless sensor networks. Firstly, the non-uniform clustering method is applied to the network. Secondly when calculating the cluster radius, the residual energy of nodes, the density of nodes and the distances between the nodes and base station will be taken into account. Then, the algorithm establishes the shortest path tree to search the optimal multi-hop transmission paths to realize efficient data transmission from sensor nodes to base station. Simulation results demonstrate that the improved algorithm can efficiently decrease the dead speed of the nodes, balance the energy dissipation of all nodes, and prolong the network lifetime.
Year
DOI
Venue
2016
10.1007/978-981-10-3023-9_54
ADVANCES IN COMPUTER SCIENCE AND UBIQUITOUS COMPUTING
Keywords
DocType
Volume
Wireless sensor networks (WSNs),Uneven clustering,Shortest routing tree,Network lifetime
Conference
421
ISSN
Citations 
PageRank 
1876-1100
0
0.34
References 
Authors
0
5
Name
Order
Citations
PageRank
jin wang124336.79
Yiquan Cao2362.29
Jiayi Cao3663.22
Huan Ji401.01
Xiaofeng Yu511.02