Robustness and performance analysis of a dynamic sensor network scheduling algorithm

This paper presents the robustness and performance analysis of the Controlled Greedy Sleep algorithm, which was designed to provide k-coverage in wireless sensor networks. The aim of this algorithm is to prolong network lifetime while ensuring QoS requirements in a dynamic manner. We investigated how the network can be strenghtened to improve performance characteristics, and how this algorithm ensures graceful degradation (i.e., how the network will provide less accurate measurement data as sensors become unavailable). We also test the robustness of the algorithm by measuring the effect of message loss due to communication errors. We compare the results to those of a very known and frequently used random algorithm. Our performance tests are based on simulations results.

[1]  Mingyan Liu,et al.  Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[2]  Giuseppe Anastasi,et al.  Performance measurements of motes sensor networks , 2004, MSWiM '04.

[3]  Geraldo Robson Mateus,et al.  An Optimal Node Scheduling for Flat Wireless Sensor Networks , 2005, ICN.

[4]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[5]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

[6]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[7]  Sajal K. Das,et al.  On computing conditional fault-tolerance measures for k-covered wireless sensor networks , 2006, MSWiM '06.

[8]  G. Simon,et al.  Simulation-based optimization of communication protocols for large-scale wireless sensor networks , 2003, 2003 IEEE Aerospace Conference Proceedings (Cat. No.03TH8652).

[9]  Hari Balakrishnan,et al.  Minimizing Energy for Wireless Web Access with Bounded Slowdown , 2002, MobiCom '02.

[10]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[11]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

[12]  Gyula Simon,et al.  Robust $k$-Coverage Algorithms for Sensor Networks , 2008, IEEE Transactions on Instrumentation and Measurement.

[13]  Michele Garetto,et al.  Modeling the performance of wireless sensor networks , 2004, IEEE INFOCOM 2004.

[14]  Deborah A. Wallach,et al.  μSleep: a technique for reducing energy consumption in handheld devices , 2004, MobiSys '04.

[15]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[16]  Sajal K. Das,et al.  Coverage and Connectivity Issues in Wireless Sensor Networks , 2005 .

[17]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[18]  Miodrag Potkonjak,et al.  Fault Tolerance in Wireless Ad-Hoc Sensor Networks , 2007 .