Connected wireless camera network deployment with visibility coverage

We consider the problem of deployment of cameras inside a complex indoor setting for surveillance applications. We formulate the problem of the minimum guarding network that places a minimum number of cameras satisfying both visual coverage of the domain and wireless network connectivity. We prove that finding the minimum guarding network in both the geometric setting and discrete setting is NP-hard. We also give a 2-approximation algorithm to the geometric minimum guarding network. Motivated by the connection of this problem with the watchman tour problem and the art gallery problem, we develop two algorithms that generate satisfactory results in a prototype testbed and in our simulations.

[1]  Lui Sha,et al.  Aperiodic task scheduling for Hard-Real-Time systems , 2006, Real-Time Systems.

[2]  Yi Wang,et al.  On full-view coverage in camera sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.

[3]  Weiping Zhu,et al.  Self-orienting the cameras for maximizing the view-coverage ratio in camera sensor networks , 2015, Pervasive Mob. Comput..

[4]  Jingyuan Li,et al.  Automatic and robust breadcrumb system deployment for indoor firefighter applications , 2010, MobiSys '10.

[5]  Tarek F. Abdelzaher,et al.  EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[6]  Raghu Machiraju,et al.  Coverage optimization to support security monitoring , 2007, Comput. Environ. Urban Syst..

[7]  Jie Gao,et al.  Connected wireless camera network deployment with visibility coverage , 2014, INFOCOM.

[8]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[9]  Mongi A. Abidi,et al.  Can You See Me Now? Sensor Positioning for Automated and Persistent Surveillance , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[10]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[11]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[12]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[13]  Cid C. de Souza,et al.  The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm , 2013, SEA.

[14]  Stan Sclaroff,et al.  Optimal Placement of Cameras in Floorplans to Satisfy Task Requirements and Cost Constraints , 2004 .

[15]  James King.  Fast vertex guarding for polygons with and without holes , 2013, Comput. Geom..

[16]  Rajeev Mohan Sharma,et al.  Relay node placement in wireless sensor networks using modified genetic algorithm , 2016, 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT).

[17]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[18]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[19]  Joseph S. B. Mitchell,et al.  Locating Guards for Visibility Coverage of Polygons , 2007, Int. J. Comput. Geom. Appl..

[20]  Guihai Chen,et al.  A survey on barrier coverage with sensors , 2016, Frontiers of Computer Science.

[21]  Kemal Akkaya,et al.  Optimal Camera Placement for Providing Angular Coverage in Wireless Video Sensor Networks , 2014, IEEE Transactions on Computers.

[22]  Gang Zhou,et al.  VigilNet: An integrated sensor network system for energy-efficient surveillance , 2006, TOSN.

[23]  Xuehou Tan,et al.  Fast computation of shortest watchman routes in simple polygons , 2001, Inf. Process. Lett..

[24]  Yang Yang,et al.  Minimum Spanning Tree with Neighborhoods , 2007, AAIM.

[25]  Frank Hoffmann,et al.  The art gallery theorem for polygons with holes , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[26]  Csaba D. Tóth,et al.  Watchman tours for polygons with holes , 2012, CCCG.

[27]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[28]  Rajesh K. Gupta,et al.  Speed control and scheduling of data mules in sensor networks , 2010, TOSN.

[29]  Peter Kovesi,et al.  Automatic Sensor Placement from Vision Task Requirements , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[30]  Huadong Ma,et al.  On Coverage Problems of Directional Sensor Networks , 2005, MSN.

[31]  Xiaohua Jia,et al.  Mobility-Assisted Spatiotemporal Detection in Wireless Sensor Networks , 2008, 2008 The 28th International Conference on Distributed Computing Systems.

[32]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[33]  Sang Hyuk Son,et al.  EnviroTrack: towards an environmental computing paradigm for distributed sensor networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

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

[35]  Hichem Snoussi,et al.  Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks , 2015, Comput. Oper. Res..

[36]  Jie Wu,et al.  Collaborative mobile charging for sensor networks , 2012, 2012 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS 2012).

[37]  Fan Yang,et al.  Local face-view barrier coverage in camera sensor networks , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[38]  Val Pinciu,et al.  Art gallery theorems for guarded guards , 2003, Comput. Geom..

[39]  Ken Kennedy,et al.  TaskScheduling Strategies forWorkflow-based Applications inGrids , 2005 .

[40]  Larry S. Davis,et al.  Visibility Analysis and Sensor Planning in Dynamic Environments , 2004, ECCV.

[41]  Jian Zhao,et al.  Multi-Camera Surveillance with Visual Tagging and Generic Camera Placement , 2007, 2007 First ACM/IEEE International Conference on Distributed Smart Cameras.

[42]  Subir Kumar Ghosh,et al.  Approximation Algorithms for Art Gallery Problems in Polygons and Terrains , 2010, WALCOM.

[43]  XUEHOU TAN,et al.  Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes" , 1999, Int. J. Comput. Geom. Appl..

[44]  Simeon C. Ntafos,et al.  Optimum watchman routes , 1986, SCG '86.

[45]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

[46]  Wei-Pand Chin,et al.  Shortest watchman routes in simple polygons , 1990, Discret. Comput. Geom..

[47]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[48]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[49]  Guohui Lin,et al.  Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..

[50]  Mongi A. Abidi,et al.  Sensor planning for automated and persistent object tracking with multiple cameras , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[51]  Luca Merciadri.  The Angström Manual , 2010 .

[52]  J. Kahn,et al.  Traditional Galleries Require Fewer Watchmen , 1983 .

[53]  D. T. Lee,et al.  Computational Complexity of Art Gallery Problems , 1990, Autonomous Robot Vehicles.

[54]  Donghyun Kim,et al.  Enhancing barrier coverage with β quality of monitoring in wireless camera sensor networks , 2016, Ad Hoc Networks.

[55]  Andrzej M. Goscinski,et al.  The Impact of Under-Estimated Length of Jobs on EASY-Backfill Scheduling , 2008, 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008).

[56]  Prasanta K. Jana,et al.  Genetic Algorithm for k-Connected Relay Node Placement in Wireless Sensor Networks , 2016 .

[57]  Joseph S. B. Mitchell,et al.  Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.

[58]  V. K. Singh,et al.  A design methodology for selection and placement of sensors in multimedia surveillance systems , 2006, VSSN '06.

[59]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, Theor. Comput. Sci..

[60]  Matt Welsh,et al.  Sensor networks for emergency response: challenges and opportunities , 2004, IEEE Pervasive Computing.

[61]  Svante Carlsson,et al.  Finding the Shortest Watchman Route in a Simple Polygon , 1993, ISAAC.

[62]  Tomio Hirata,et al.  Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes" , 1991, Int. J. Comput. Geom. Appl..

[63]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .