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. Index Terms—Visibility Coverage, Wireless Connectivity, Cam- era Networks

[1]  Tomio Hirata,et al.  An incremental algorithm for constructing shortest watchman routes , 1993, Int. J. Comput. Geom. Appl..

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

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

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

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

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

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

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

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

[10]  Simeon C. Ntafos,et al.  Optimum Watchman Routes , 1988, Inf. Process. Lett..

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

[12]  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.

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

[14]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..

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

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

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

[18]  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.

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

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

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

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

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

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

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

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

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