Scheduling Battery-Powered Sensor Networks for Minimizing Detection Delays

Sensor networks monitoring spatially distributed physical systems often comprise battery-powered sensor devices. To extend lifetime, battery power may be conserved using sleep scheduling: activating and deactivating some of the sensors from time to time. Scheduling sensors with the goal of maximizing average coverage, which is the average fraction of time for which each monitoring target is covered by some active sensor, have been studied extensively. However, many applications also require time-critical monitoring in the sense that one has to minimize the average delay until an unpredictable change or event at a monitoring target is detected. In this letter, we study the problem of sleep scheduling sensors to minimize the average delay in detecting such time-critical events in the context of monitoring physical systems that can be modeled using graphs, such as water-distribution networks. We provide a game-theoretic solution that computes schedules with near optimal average delays. We illustrate that schedules that optimize average coverage may result in large average detection delays, whereas schedules minimizing average detection delays using our proposed scheme also result in near optimal average coverage.

[1]  Bhavna Ambudkar,et al.  Sleep Scheduling for Critical Event Monitoring in Wireless Sensor Networks , 2015 .

[2]  Ying Zhang,et al.  Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks , 2010, IEEE Transactions on Computers.

[3]  Yevgeniy Vorobeychik,et al.  Scheduling Resource-Bounded Monitoring Devices for Event Detection and Isolation in Networks , 2016, IEEE Transactions on Network Science and Engineering.

[4]  Magnus Egerstedt,et al.  Communication-Free Distributed Coverage for Networked Systems , 2015, IEEE Transactions on Control of Network Systems.

[5]  Raja Datta,et al.  A two-tier strategy for priority based critical event surveillance with wireless multimedia sensors , 2016, Wirel. Networks.

[6]  Chen Wang,et al.  Optimization scheme for sensor coverage scheduling with bandwidth constraints , 2009, Optim. Lett..

[7]  Jason R. Marden,et al.  Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[8]  Nitin H. Vaidya,et al.  A wakeup scheme for sensor networks: achieving balance between energy saving and end-to-end delay , 2004, Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004..

[9]  Mario Di Francesco,et al.  Energy conservation in wireless sensor networks: A survey , 2009, Ad Hoc Networks.

[10]  Avi Ostfeld,et al.  The Battle of the Water Sensor Networks (BWSN): A Design Challenge for Engineers and Algorithms , 2008 .

[11]  L. Blume The Statistical Mechanics of Strategic Interaction , 1993 .

[12]  Marc Sevaux,et al.  Column generation algorithm for sensor coverage scheduling under bandwidth constraints , 2012, Networks.

[13]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[14]  Anurag Kumar,et al.  Optimal Sleep-Wake Scheduling for Quickest Intrusion Detection Using Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.