Hua Huang
Jie Gao
Skip Abstract Section
Abstract
System deployments of IoT systems have drawn research attention, because it is very challenging to meet both physical and cyber constraints in real systems. In this article, we consider the problem of deploying wireless camera networks inside a complex indoor setting for surveillance applications. We formulate the problem of the minimum connected guarding network whose objective is to place a minimum number of cameras satisfying both visual coverage of the domain and wireless network connectivity. We prove that finding the minimum connected guarding network is NP-hard in both the geometric and discrete settings. We also give a 2-approximation algorithm to the geometric minimum guarding network problem. Motivated by the connection of this problem with the watchman tour problem and the art gallery problem, we developed two algorithms to calculate the locations of camera deployment. By deploying a prototype testbed, we verify the feasibility of the system design. Using simulations on 20 real floor plans, we demonstrate that our solutions reduce the number of cameras by up to 28%, and reduce the number of relay nodes by up to 47%.
- Jamal N. Al-Karaki and Amjad Gawanmeh. 2017. The optimal deployment, coverage, and connectivity problems in wireless sensor networks: Revisited. IEEE Access 5 (2017), 18051--18065.Google Scholar
Cross Ref
- Yoav Amit, Joseph S. B. Mitchell, and Eli Packer. 2010. Locating guards for visibility coverage of polygons. International Journal of Computational Geometry 8 Applications 20, 05 (2010), 601--630.Google Scholar
- Catalina Aranzazu-Suescun and Mihaela Cardei. 2018. Weak-barrier coverage with adaptive sensor rotation. In International Conference on Combinatorial Optimization and Applications. Springer, 739--754.Google Scholar
- Nguyen Thi My Binh, Huynh Thi Thanh Binh, Vu Le Loi, Vu Trung Nghia, Dang Lam San, and Chu Minh Thang. 2019. An efficient approximate algorithm for achieving (k-!) barrier coverage in camera wireless sensor networks. In Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications, Vol. 11006. International Society for Optics and Photonics, 1100613.Google Scholar
- Tisha Brown, Zhonghui Wang, Tong Shan, Feng Wang, and Jianxia Xue. 2017. Obstacle-aware wireless video sensor network deployment for 3d indoor monitoring. In GLOBECOM 2017-2017 IEEE Global Communications Conference. IEEE, 1--6.Google Scholar
- S. Carlsson, H. Jonsson, and B. J. Nilsson. 1999. Finding the shortest watchman route in a simple polygon. Discrete 8 Computational Geometry 22, 3 (1999), 377--402. DOI:https://doi.org/10.1007/PL00009467Google Scholar
- Chih-Yung Chang, Chih-Yao Hsiao, Ming Hour Yang, and Sheng-Shih Wang. 2018. Surveillance algorithms for barrier coverage in wireless camera sensor networks. In 2018 International Conference on Electronics Technology (ICET’18). IEEE, 111--115.Google Scholar
- Donghui Chen, Ding-Zhu Du, Xiao-Dong Hu, Guo-Hui Lin, Lusheng Wang, and Guoliang Xue. 2000. Approximations for Steiner trees with minimum number of Steiner points. Journal of Global Optimization 18, 1 (2000), 17--33. DOI:https://doi.org/10.1023/A:1008384012064Google ScholarDigital Library
- Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, and Baogang Xu. 2008. Relay sensor placement in wireless sensor networks. Wireless Networks 14, 3 (2008), 347--355.Google ScholarDigital Library
- W. Chin and S. Ntafos. 1986. Optimum watchman routes. In 2nd Proc. ACM Symposium on Computational Geometry. ACM Press, New York, New York, 24--33.Google Scholar
- W. P. Chin and S. Ntafos. 1991. Shortest watchman routes in simple polygons. Discrete 8 Computational Geometry 6, 1 (1991), 9--31.Google Scholar
- V. Chvátal. 1975. A combinatorial theorem in plane geometry. Journal of Combinatorial Theory, Series B 18 (1975), 39--41.Google ScholarCross Ref
- Cregg K. Cowan and Peter D. Kovesi. 1988. Automatic sensor placement from vision task requirements. IEEE Transactions on Pattern Analysis and Machine Intelligence, 10, 3 (1988), 407--416.Google ScholarDigital Library
- Adrian Dumitrescu, Joseph S. B. Mitchell, and Pawel Żyliński. 2014. The minimum guarding tree problem. Discrete Mathematics, Algorithms and Applications 6, 01 (2014), 1450011.Google Scholar
- Adrian Dumitrescu and Csaba D. Tóth. 2012. Watchman tours for polygons with holes. Computational Geometry 45, 7 (2012), 326--333. DOI:https://doi.org/10.1016/j.comgeo.2012.02.001Google ScholarDigital Library
- Yasser El Khamlichi, Abderrahim Tahiri, Anouar Abtoy, Inmaculada Medina-Bulo, and Francisco Palomo-Lozano. 2017. A hybrid algorithm for optimal wireless sensor network deployment with the minimum number of sensor nodes. Algorithms 10, 3 (2017), 80.Google Scholar
- Mohammed Farsi, Mostafa A Elhosseini, Mahmoud Badawy, Hesham Arafat Ali, and Hanaa Zain Eldin. 2019. Deployment techniques in wireless sensor networks, coverage and connectivity: A survey. IEEE Access 7 (2019), 28940--28954.Google ScholarCross Ref
- Steve Fisk. 1978. A short proof of Chvátal’s watchman theorem. Journal of Combinatorial Theory, Series B 24, 3 (1978), 374.Google ScholarCross Ref
- Xiaofeng Gao, Rui Yang, Fan Wu, Guihai Chen, and Jinguang Zhou. 2017. Optimization of full-view barrier coverage with rotatable camera sensors. In 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS’17). IEEE, 870--879.Google Scholar
- Jobin George and Rajeev Mohan Sharma. 2016. Relay node placement in wireless sensor networks using modified genetic algorithm. In 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT’16). IEEE, 551--556.Google Scholar
- Subir Kumar Ghosh. 2010. Approximation algorithms for art gallery problems in polygons and terrains. In International Workshop on Algorithms and Computation. Springer, 21--34.Google Scholar
- Ling Guo, Deying Li, Yuqing Zhu, Donghyun Kim, Yi Hong, and Wenping Chen. 2016. Enhancing barrier coverage with β quality of monitoring in wireless camera sensor networks. Ad Hoc Networks 51 (2016), 62--79.Google ScholarDigital Library
- Suneet K. Gupta, Pratyay Kuila, and Prasanta K. Jana. 2016. Genetic algorithm for k-connected relay node placement in wireless sensor networks. In Proceedings of the 2nd International Conference on Computer and Communication Technologies. Springer, 721--729.Google Scholar
- Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan. 2000. Energy-efficient communication protocol for wireless microsensor networks. In Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, 2000. IEEE, 10 pp.Google ScholarDigital Library
- F. Hoffmann, M. Kaufmann, and K. Kriegel. 1991. The art gallery theorem for polygons with holes. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science. 39--48.Google Scholar
- Andrew Howard, Maja J. Matarić, and Gaurav S. Sukhatme. 2002. Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem. In Distributed Autonomous Robotic Systems 5. Springer, 299--308.Google Scholar
- Yang-Pu Hsiao, Kuei-Ping Shih, and Yen-Da Chen. 2017. On full-view area coverage by rotatable cameras in wireless camera sensor networks. In Proceedings of the 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA’17). IEEE, 260--265.Google Scholar
- Chi-Fu Huang and Yu-Chee Tseng. 2005. The coverage problem in a wireless sensor network. Mobile Networks and Applications 10, 4 (2005), 519--528.Google ScholarDigital Library
- Hua Huang, Chien-Chun Ni, Xiaomeng Ban, Jie Gao, Andrew T. Schneider, and Shan Lin. 2014. Connected wireless camera network deployment with visibility coverage. In IEEE INFOCOM 2014, Proceedings of the IEEE Conference on Computer Communications. IEEE, 1204--1212. DOI:10.1109/INFOCOM.2014.6848052Google Scholar
- Jinglan Jia, Cailin Dong, Yi Hong, Ling Guo, and Ying Yu. 2019. Maximizing full-view target coverage in camera sensor networks. Ad Hoc Networks 94 (2019), 101973.Google ScholarCross Ref
- J. Kahn, M. M. Klawe, and D. Kleitman. 1983. Traditional galleries require fewer watchmen. SIAM Journal on Algebraic Discrete Methods 4 (1983), 194--206.Google ScholarCross Ref
- James King. 2013. Fast vertex guarding for polygons with and without holes. Computational Geometry 46, 3 (2013), 219--231.Google ScholarDigital Library
- Guillermo J. Laguna and Sourabh Bhattacharya. 2017. Hybrid system for target tracking in triangulation graphs. In Proceedings of the 2017 IEEE International Conference on Robotics and Automation (ICRA’17). IEEE, 839--844.Google Scholar
- Guillermo J. Laguna and Sourabh Bhattacharya. 2019. Adaptive target tracking with a mixed team of static and mobile guards: deployment and activation strategies. Autonomous Robots (2019), 1--13.Google Scholar
- Guo-Hui Lin and Guoliang Xue. 1999. Steiner tree problem with minimum number of Steiner points and bounded edge-length. Information Processing Letters 69, 2 (1999), 53--57.Google ScholarDigital Library
- Hengchang Liu, Jingyuan Li, Zhiheng Xie, Shan Lin, Kamin Whitehouse, John A. Stankovic, and David Siu. 2010. Automatic and robust breadcrumb system deployment for indoor firefighter applications. In Proceedings of the 8th International Conference on Mobile Systems, Applications, and Services. ACM, 21--34.Google ScholarDigital Library
- Huadong Ma and Yonghe Liu. 2005. On coverage problems of directional sensor networks. In International Conference on Mobile Ad-Hoc and Sensor Networks. Springer, 721--731.Google Scholar
- Cristian S. Mata and Joseph S. B. Mitchell. 1995. Approximation algorithms for geometric tour and network design problems (extended abstract). In Proceedings of the 11th Annual Symposium on Computational Geometry (SCG’95). ACM, New York, NY, 360--369. DOI:https://doi.org/10.1145/220279.220318Google Scholar
- T. S. Michael and Val Pinciu. 2003. Art gallery theorems for guarded guards. Computational Geometry: Theory and Applications 26, 3 (Nov. 2003), 247--258. DOI:https://doi.org/10.1016/S0925-7721(03)00039-7Google Scholar
- Anurag Mittal and Larry S. Davis. 2004. Visibility analysis and sensor planning in dynamic environments. In Computer Vision-ECCV 2004. Springer, 175--189.Google Scholar
- Alan T. Murray, Kamyoung Kim, James W. Davis, Raghu Machiraju, and Richard Parent. 2007. Coverage optimization to support security monitoring. Computers, Environment and Urban Systems 31, 2 (2007), 133--147.Google ScholarCross Ref
- Bengt J. Nilsson and Svante Carlsson. 1994. Guarding Art Galleries: Methods for Mobile Guards.Google Scholar
- Joseph O’Rourke. 1987. Art Gallery Theorems and Algorithms. Vol. 1092. Oxford University Press, Oxford.Google ScholarDigital Library
- Siva Ram, K. R. Ramakrishnan, P. K. Atrey, V. K. Singh, and M. S. Kankanhalli. 2006. A design methodology for selection and placement of sensors in multimedia surveillance systems. In Proceedings of the 4th ACM International Workshop on Video Surveillance and Sensor Networks. ACM, 121--130.Google Scholar
- Maher Rebai, Hichem Snoussi, Faicel Hnaien, Lyes Khoukhi, et al. 2015. Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks. Computers 8 Operations Research 59 (2015), 11--21.Google Scholar
- Pengju Si, Chengdong Wu, Yunzhou Zhang, Zixi Jia, Peng Ji, and Hao Chu. 2017. Barrier coverage for 3D camera sensor networks. Sensors 17, 8 (2017), 1771.Google ScholarCross Ref
- Simone Silvestri and Ken Goss. 2017. MobiBar: An autonomous deployment algorithm for barrier coverage with mobile sensors. Ad Hoc Networks 54 (2017), 111--129.Google ScholarCross Ref
- X Tan. 1999. Corrigendum to an incremental algorithm for constructing shortest watchman routes. International Journal of Computational Geometry and Applications 9 (1999), 319--323.Google ScholarCross Ref
- Xuehou Tan. 2001. Fast computation of shortest watchman routes in simple polygons. Information Processing Letters 77, 1 (2001), 27--33.Google ScholarDigital Library
- X. Tan, T. Hirata, and Y. Inagaki. 1993. An incremental algorithm for constructing shortest watchman routes. International Journal of Computational Geometry and Applications 3, 04 (1993), 351--365.Google ScholarCross Ref
- Davi C, Tozoni, Pedro J, de Rezende, and Cid C, de Souza. 2013. The quest for optimal solutions for the art gallery problem: A practical iterative algorithm. In International Symposium on Experimental Algorithms. Springer, 320--336.Google Scholar
- Jorge Urrutia. 2000. Art gallery and illumination problems. Handbook of Computational Geometry (2000), 973--1027.Google Scholar
- Yi Wang and Guohong Cao. 2011. On full-view coverage in camera sensor networks. In 2011 Proceedings IEEE INFOCOM. IEEE, 1781--1789.Google Scholar
- Fan Wu, Yang Gui, Zhibo Wang, Xiaofeng Gao, and Guihai Chen. 2016. A survey on barrier coverage with sensors. Frontiers of Computer Science 10, 6 (2016), 968--984.Google ScholarDigital Library
- Chao Yang, Weiping Zhu, Jia Liu, Lijun Chen, Daoxu Chen, and Jiannong Cao. 2014. Self-orienting the cameras for maximizing the view-coverage ratio in camera sensor networks. Pervasive and Mobile Computing (2014).Google Scholar
- Yang Yang, Mingen Lin, Jinhui Xu, and Yulai Xie. 2007. Minimum spanning tree with neighborhoods. In Algorithmic Aspects in Information and Management. Springer, 306--316.Google Scholar
- Yi Yao, Chung-Hao Chen, Besma Abidi, David Page, Andreas Koschan, and Mongi Abidi. 2008. Sensor planning for automated and persistent object tracking with multiple cameras. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2008 (CVPR 2008). IEEE, 1--8.Google Scholar
- Yi Yao, Chung-Hao Chen, Besma Abidi, David Page, Andreas Koschan, and Mongi Abidi. 2010. Can you see me now? Sensor positioning for automated and persistent surveillance. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 40, 1 (2010), 101--115.Google ScholarDigital Library
- E. Yildiz, K. Akkaya, E. Sisikoglu, and M. Y. Sir. 2014. Optimal camera placement for providing angular coverage in wireless video sensor networks. IEEE Transactions on Computers 63, 7 (July 2014), 1812--1825. DOI:https://doi.org/10.1109/TC.2013.45Google Scholar
- Zuoming Yu, Fan Yang, Jin Teng, Adam C. Champion, and Dong Xuan. 2015. Local face-view barrier coverage in camera sensor networks. In Proceedings of the 2015 IEEE Conference on Computer Communications (INFOCOM’15). IEEE, 684--692.Google Scholar
- Jian Zhao, S. Cheung, et al. 2007. Multi-camera surveillance with visual tagging and generic camera placement. In Proceedings of the 1st ACM/IEEE International Conference on Distributed Smart Cameras, 2007 (ICDSC’07). IEEE, 259--266.Google Scholar
Index Terms
- Connected Wireless Camera Network Deployment with Visibility Coverage
Recommendations
Empirical robustness analysis of wireless connectivity in sensor network deployments for assisted living at home
Telehealth '07: The Third IASTED International Conference on TelehealthHealthcare and, in particular, telehealth applications are prospective areas for using low power, wireless sensors for remote monitoring. Elderly people can ask for remote assistance with the help of wireless sensor networks and stay at home with ...
Minimum k, ω-angle barrier coverage in wireless camera sensor networks
Barrier coverage is an important issue in wireless sensor networks, which guarantees to detect any intruder attempting to cross a barrier or penetrating a protected region monitored by sensors. However, the barrier coverage problem in wireless camera ...
Corona based deployment strategies in wireless sensor network
A wireless sensor network (WSN) is composed of a large number of sensor nodes, relay nodes, and a base station, that are deployed in an environment to collect information. WSNs are getting more widespread use and have been adapted to a vast array of ...
Comments