2012 Sixth International Symposium on Theoretical Aspects of Software Engineering (2012)
Beijing, China China
July 4, 2012 to July 6, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TASE.2012.28
Wireless sensor networks with hundreds of sensor nodes have emerged in recent years as important platforms for a wide spectrum of monitoring tasks ranging from environmental to military applications. In order to support scalability and increase lifetime of these networks, sensor nodes are preferably grouped into clusters. A large number of clustering protocols have been proposed in the literature with different aims, requirements and efficiency. Previous comparative studies of such protocols were usually based on simulation, which, however, only provides average case results on the limited state space explored. To mend this situation, in this paper, we evaluate and compare four state-of-the-art clustering protocols, i.e., LEACH, GEN-LEACH, HEED and PANEL, with full state space exploration. Within our analytical framework that consists of a network configuration and an energy consumption model, we aim at analyzing the correctness and performance of the investigated protocols. Our analysis is conducted formally through probabilistic model checking using PRISM and has its focus on the quantitative aspects of the protocols.
sensor networks, clustering protocols, probabilistic model checking, performance
Q. Li, P. Schaffer, J. Pang and S. Mauw, "Comparative Analysis of Clustering Protocols with Probabilistic Model Checking," 2012 Sixth International Symposium on Theoretical Aspects of Software Engineering(TASE), Beijing, China China, 2012, pp. 249-252.