Application-Driven Node Management in Multihop Wireless Sensor Networks

A strategy for energy saving in wireless sensor networks is to manage the duty cycle of sensors, by dynamically selecting a different set of nodes to be active in every moment. We propose a strategy for node selection in multihop sensor networks that prioritizes nodes with larger residual energy and relevance for the application. The proposed scheme is based on an implementation of the knapsack algorithm and it seeks to maximize the network lifetime, while assuring the application QoS. An environmental monitoring application was simulated and huge energy savings were achieved with the proposed scheduling algorithm.

[1]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[2]  Ian F. Akyildiz,et al.  Wireless sensor networks , 2007 .

[3]  Wendi B. Heinzelman,et al.  Sensor management policies to provide application QoS , 2003, Ad Hoc Networks.

[4]  Jeff Frolik,et al.  QoS control for random access wireless sensor networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[5]  Wendi B. Heinzelman,et al.  Optimal sensor management under energy and reliability constraints , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[6]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[7]  János Pach,et al.  Combinatorial Geometry , 2012 .

[8]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[9]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[10]  J. Pach,et al.  Combinatorial geometry , 1995, Wiley-Interscience series in discrete mathematics and optimization.