Optimized Algorithm for Clustering Routing for Wireless Sensor Networks

HTML  XML Download Download as PDF (Size: 1028KB)  PP. 1-11  
DOI: 10.4236/jcc.2018.611001    923 Downloads   2,207 Views  Citations

ABSTRACT

LEACH protocol randomly selects cluster head nodes in a cyclic manner. It may cause network to be unstable, if the low energy node is elected as the cluster head. If the size of cluster is too large or too small, it will affect the survival time of the network. To address this issue, an improved solution was proposed. Firstly, the scheme considered the average and standard deviation of the nodes’ residual energy and the distance between the node and the base station, then considered the distance between the node and the cluster head and the energy of the cluster head to optimize the cluster head selection and clustering. The performance analysis results showed this scheme could reduce premature deaths of the cluster heads and too high energy consumption of some clusters. Thus, the proposed algorithm could prompt the stability and prolong the lifetime of the network.

Share and Cite:

Chang, T. , Liu, W. and Zhang, Y. (2018) Optimized Algorithm for Clustering Routing for Wireless Sensor Networks. Journal of Computer and Communications, 6, 1-11. doi: 10.4236/jcc.2018.611001.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.