An efficient routing protocol based on two step cluster head selection for wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Cluster number variability problem in LEACH
UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing
| Hi-index | 0.00 |
Abstract: Distributed clustering architecture has been considered an effective and practical model to offer energy-efficient, load-balancing, scalable, and robust communication for Wireless Sensor Networks (WSNs). In this paper, we compare and analyze various clustering schemes based on a comprehensive classification. We propose a bi-dimensional Markov chain model for analyzing a class of distributed, dynamic, and randomized (DDR) clustering schemes. With this model, we present extensive evaluation of stochastic properties of a representative DDR clustering scheme 驴 Low Energy Adaptive Clustering Hierarchy (LEACH), in terms of the distribution of cluster number, the mean, the standard deviation and coefficient of variation of number of clusters. The results indicate that the number of clusters generated in LEACH-like DDR schemes is a random variable, which can not concentrate with in a narrow range of the optimal value. This variability in the number of clusters adversely affects the system lifetime.