Scheduling Resource-Bounded Monitoring Devices for Event Detection and Isolation in Networks

In networked systems, monitoring devices such as sensors are typically deployed to monitor various target locations. Targets are the points in the physical space at which events of some interest, such as random faults or attacks, can occur. Most often, monitoring devices have limited energy supplies, and they can operate for a limited duration. As a result, energy-efficient monitoring of target locations through a set of monitoring devices with limited energy supplies is a crucial problem in networked systems. In this paper, we study optimal scheduling of monitoring devices to maximize network coverage for detecting and isolating events on targets for a given network lifetime. The monitoring devices considered could remain active only for a fraction of the overall network lifetime. We formulate the problem of scheduling of monitoring devices as a graph labeling problem, which unlike other existing solutions, allows us to directly utilize the underlying network structure to explore the trade-off between coverage and network lifetime. In this direction, first we present a greedy heuristic, and then a game-theoretic solution to the graph labeling problem. The proposed setup can be used to simultaneously solve the scheduling and placement of monitoring devices, which, as our simulations illustrate, gives improved performance as compared to separately solving the placement and scheduling problems. Finally, we illustrate our results on various networks, including real-world water distribution networks and random geometric networks.

[1]  William A. Brock,et al.  Discrete Choice with Social Interactions , 2001 .

[2]  M. Iqbal,et al.  Sensor Networks for Monitoring and Control of Water Distribution Systems , 2013 .

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

[4]  Selim G. Akl,et al.  Maximizing the lifetime of wireless sensor networks through domatic partition , 2009, 2009 IEEE 34th Conference on Local Computer Networks.

[5]  Sungsoo Park,et al.  A New Mathematical Formulation and a Heuristic for the Maximum Disjoint Set Covers Problem to Improve the Lifetime of the Wireless Sensor Network , 2011, Ad Hoc Sens. Wirel. Networks.

[6]  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).

[7]  Saurabh Amin,et al.  An Efficient Approach to Fault Identification in Urban Water Networks Using Multi-Level Sensing , 2015, BuildSys@SenSys.

[8]  Aravind Srinivasan,et al.  Approximating the Domatic Number , 2002, SIAM J. Comput..

[9]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[10]  Erik Frisk,et al.  Sensor Placement for Fault Diagnosis , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[11]  Magnus Egerstedt,et al.  A Game Theoretic Approach to Distributed Coverage of Graphs by Heterogeneous Mobile Agents , 2013 .

[12]  Robin Thomas,et al.  Deploying Robots With Two Sensors in K1, 6‐Free Graphs , 2013, J. Graph Theory.

[13]  Sonia Martínez,et al.  Distributed Coverage Games for Energy-Aware Mobile Sensor Networks , 2013, SIAM J. Control. Optim..

[14]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[15]  Kamal Youcef-Toumi,et al.  Optimal coverage of an infrastructure network using sensors with distance-decaying sensing quality , 2013, Autom..

[16]  H. Young,et al.  The Evolution of Conventions , 1993 .

[17]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[18]  Asuman E. Ozdaglar,et al.  Network Games: Theory, Models, and Dynamics , 2011, Network Games: Theory, Models, and Dynamics.

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

[20]  Weili Wu,et al.  Energy-efficient target coverage in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[21]  Imran A. Pirwani,et al.  Energy conservation via domatic partitions , 2006, MobiHoc '06.

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

[23]  Jason R. Marden,et al.  Autonomous Vehicle-Target Assignment: A Game-Theoretical Formulation , 2007 .

[24]  Andreas Krause,et al.  Simultaneous Optimization of Sensor Placements and Balanced Schedules , 2011, IEEE Transactions on Automatic Control.

[25]  Chen Wang,et al.  Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[26]  Cem Ersoy,et al.  An efficient heuristic for placement, scheduling and routing in wireless sensor networks , 2008, 2008 23rd International Symposium on Computer and Information Sciences.

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

[28]  Satoshi Fujita,et al.  A Study on r-Configurations - A Resource Assignment Problem on Graphs , 2000, SIAM J. Discret. Math..

[29]  Thomas Erlebach,et al.  Approximating Maximum Disjoint Coverage in Wireless Sensor Networks , 2013, ADHOC-NOW.

[30]  Roger Wattenhofer,et al.  Maximizing the lifetime of dominating sets , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[31]  W. Hart,et al.  Review of Sensor Placement Strategies for Contamination Warning Systems in Drinking Water Distribution Systems , 2010 .

[32]  Bang Wang,et al.  Coverage problems in sensor networks: A survey , 2011, CSUR.

[33]  Sandip Roy,et al.  Detecting link failures in complex network processes using remote monitoring , 2015, 2015 American Control Conference (ACC).

[34]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[35]  Mohamed F. Younis,et al.  Strategies and techniques for node placement in wireless sensor networks: A survey , 2008, Ad Hoc Networks.

[36]  Malcolm Farley,et al.  Losses in Water Distribution Networks: A Practitioners' Guide to Assessment, Monitoring and Control , 2015 .

[37]  Jiguo Yu,et al.  Domatic partition in homogeneous wireless sensor networks , 2014, J. Netw. Comput. Appl..

[38]  Samir Khuller,et al.  Energy Efficient Monitoring in Sensor Networks , 2008, LATIN.

[39]  Feng Zhao,et al.  Information-driven dynamic sensor collaboration , 2002, IEEE Signal Process. Mag..

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

[41]  Saurabh Amin,et al.  Sensor placement for fault location identification in water networks: A minimum test cover approach , 2015, Autom..

[42]  Amanda D. Lothes,et al.  Research Database of Water Distribution System Models , 2014 .

[43]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[44]  Victor M. Preciado,et al.  Detection and Isolation of Failures in Directed Networks of LTI Systems , 2014, IEEE Transactions on Control of Network Systems.

[45]  Andreas Krause,et al.  Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks , 2008 .

[46]  Miodrag Potkonjak,et al.  Sleeping Coordination for Comprehensive Sensing Using Isotonic Regression and Domatic Partitions , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.