Abstract
LEACH is one of the most popular hierarchical routing algorithms for sensor networks. In LEACH, the cluster number per round takes an important effect on the network lifetime. Thus the goal of the cluster head selection algorithm is to ensure that the expected number of clusters per round equals a pre-determined optimal value k. However, a slight inaccuracy is spotted in the computation of the node self-selected probability per round. As a result, the number of clusters produced by the algorithm is distributed in a large range around the target value. We propose an improved clustering scheme (I-LEACH) to correct this inaccuracy. The experimental results show that this scheme can ensure a more stable number of clusters.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al-Karaki, J.N., Kamal, A.E.: Routing Techniques in Wireless Sensor Networks: A Survey. IEEE Wireless Communications 11(6), 6–28 (2004)
Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In: Proc. 33rd Hawaii Int’l. Conf. System Sciences, Maui, HI (2000)
Heinzelman, W.B., Chandrakasan, A.P., Balakrishnan, H.: An Application-Specific Protocol Architecture for Wireless Microsensor Networks. IEEE Tran. On Wireless Communications 1(4), 660–670 (2002)
Wang, Q., Hassanein, H., Takahara, G.: Stochastic Modeling of Distributed, Dynamic, Randomized Clustering Protocols for Wireless Sensor Networks. In: Proceedings of the 2004 International Conference on Parallel Processing Workshops, pp. 1–8 (2004)
Wang, Q., Xu, K., Hassanein, H., Takahara, G.: Swatch: A Stepwise Adaptive Clustering Hierarchy in Wireless Sensor Networks. In: NETWORKING 2005: 4th International IFIP-TC6 Networking Conference, Waterloo, Canada (2005)
Wang, Y., Xiong, M.: Monte Carlo Simulation of LEACH Protocol for Wireless Sensor Networks. In: Proceedings of the Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (2005)
Cao, Y., He, C.: A Distributed Clustering Algorithm with an Adaptive Backoff Strategy for Wireless Sensor Networks. IEICE Trans. Commun. E89-B(2), 609–613 (2006)
Ns-2: Network simulator-2, [Online], Available: http://www.isi.edu/nsnam/ns/
MIT uAMPS LEACH ns Extensions, [Online], Available: http://www.ece.rochester.edu/research/wcng/code/index.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, H., Li, L., Jin, S. (2006). Cluster Number Variability Problem in LEACH. In: Ma, J., Jin, H., Yang, L.T., Tsai, J.JP. (eds) Ubiquitous Intelligence and Computing. UIC 2006. Lecture Notes in Computer Science, vol 4159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11833529_44
Download citation
DOI: https://doi.org/10.1007/11833529_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38091-7
Online ISBN: 978-3-540-38092-4
eBook Packages: Computer ScienceComputer Science (R0)