Analytical model of energy consumption in hierarchical wireless sensor networks

Here we propose an analytical model of energy usage hierarchical wireless sensor network protocols such as LEACH [1]. LEACH has been used as a foundation for much of the wireless sensor network research, so results addressing the underlying nature of these systems build understanding of a wide range of existing protocols. First, we derive the probability density functions of the distance to the nearest cluster head, the distance to the nearest cluster head squared, and the expected number of nodes per cluster. These results are then applied to produce a model of the amount of average energy used per node for each data report. Using this model we give an analytic expression for the optimal cluster-head selection rate. The model is further improved to give an approximate adjustment for distortions in energy usage near the edges of the field. This final model is then compared to the simulation results presented in the original LEACH paper [1] and shown to be accurate. Sensor network protocol researchers can apply results presented here to improve performance of existing systems by making the cluster head selection rate adaptive to external factors.

[1]  Cauligi S. Raghavendra,et al.  PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

[2]  Edward J. Coyle,et al.  An energy efficient hierarchical clustering algorithm for wireless sensor networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  H. Thompson Distribution of Distance to Nth Neighbour in a Population of Randomly Distributed Individuals , 1956 .

[4]  S. Fossy,et al.  On a Voronoi Aggregative Process Related to a Bivariate Poisson Process , 1996 .

[5]  Mohammad Ilyas,et al.  Sensor Network Protocols , 2006 .

[6]  D.P. Agrawal,et al.  APTEEN: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[7]  Wendi B. Heinzelman,et al.  Adaptive protocols for information dissemination in wireless sensor networks , 1999, MobiCom.

[8]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[9]  Yang Xiao,et al.  Handbook on Sensor Networks , 2010 .

[10]  Wendi B. Heinzelman,et al.  Cluster head election techniques for coverage preservation in wireless sensor networks , 2009, Ad Hoc Networks.

[11]  François Baccelli,et al.  Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks , 1999, Oper. Res..