loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 International Conference on Parallel Processing Workshops (ICPPW'04)
Stochastic Modeling of Distributed, Dynamic, Randomized Clustering Protocols for Wireless Sensor Networks
Montreal, Quebec, Canada
August 15-August 18
ISBN: 0-7695-2198-3
Quanhong Wang, Queen?s University
Hossam Hassanein, Queen?s University
Glen Takahara, Queen?s University
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.
Citation:
Quanhong Wang, Hossam Hassanein, Glen Takahara, "Stochastic Modeling of Distributed, Dynamic, Randomized Clustering Protocols for Wireless Sensor Networks," icppw, pp.456-463, 2004 International Conference on Parallel Processing Workshops (ICPPW'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.