Connected wireless camera network deployment with visibility coverage

Proceedings - IEEE INFOCOM

Volumn , Issue , 2014, Pages 1204-1212

  Huang, Hua ^a   Ni, Chien Chun ^b   Ban, Xiaomeng ^b   Gao, Jie ^b   Schneider, Andrew T ^a   Lin, Shan ^a  

^a Temple University   (United States)

^b Stony Brook University   (United States)

Author keywords

Camera Networks; Visibility Coverage; Wireless Connectivity

Indexed keywords

APPROXIMATION ALGORITHMS; CAMERAS; SECURITY SYSTEMS; VISIBILITY;

ART GALLERY PROBLEM; CAMERA NETWORK; DISCRETE SETTINGS; SURVEILLANCE APPLICATIONS; VISUAL COVERAGES; WIRELESS CAMERA NETWORKS; WIRELESS CONNECTIVITIES; WIRELESS NETWORK CONNECTIVITY;

COMPLEX NETWORKS;

EID: 84904410673     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2014.6848052     Document Type: Conference Paper

References (33)

1. S. Carlsson, H. Jonsson, and B. J. Nilsson. Finding the shortest watchman route in a simple polygon. Discrete & Computational Geometry, 22(3):377-402, 1999.
2. W. Chin and S. Ntafos. Optimum watchman routes. In 2nd Proc. ACM Symposium on Computational Geometry, pages 24-33, New York, New York, USA, 1986. ACM Press.
3. W. Chin and S. Ntafos. Optimum watchman routes. Inform. Process. Lett., 28:39-44, 1988.
4. W.-p. Chin and S. Ntafos. Optimum watchman routes. Information Processing Letters, 28(1):39-44, 1988.
5. W. P. Chin and S. Ntafos. Shortest watchman routes in simple polygons. Discrete & Computational Geometry, 6(1):9-31, 1991.
6. V. Chvátal. A combinatorial theorem in plane geometry. J. Combin. Theory Ser. B, 18:39-41, 1975.
7. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of operations research, 4(3):233-235, 1979.
8. G. Coley. BeagleBone Rev A3 System Reference Manual. Beagle-Board.org, 2011.
9. C. K. Cowan and P. D. Kovesi. Automatic sensor placement from vision task requirements. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 10(3):407-416, 1988.
10. S. Fisk. A short proof of chvátal's watchman theorem. Journal of Combinatorial Theory, Series B, 24(3):374, 1978.
11. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energyefficient communication protocol for wireless microsensor networks. In System Sciences, 2000. Proceedings of the 33rd Annual Hawaii International Conference on, pages 10-pp. IEEE, 2000.
12. F. Hoffmann, M. Kaufmann, and K. Kriegel. The art gallery theorem for polygons with holes. In Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on, pages 39-48. IEEE, 1991.
13. F. Hoffmann, M. Kaufmann, and K. Kriegel. The art gallery theorem for polygons with holes. In Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., pages 39-48, 1991.
14. A. Howard, M. J. Mataríc, and G. S. Sukhatme. Mobile sensor network deployment using potential fields: A distributed, scalable solution to the area coverage problem. In Distributed Autonomous Robotic Systems 5, pages 299-308. Springer, 2002.
15. C.-F. Huang and Y.-C. Tseng. The coverage problem in a wireless sensor network. Mobile Networks and Applications, 10(4):519-528, 2005.
16. J. Kahn, M. M. Klawe, and D. Kleitman. Traditional galleries require fewer watchmen. SIAM J. Algebraic Discrete Methods, 4:194-206, 1983.
17. D. Lee and A. Lin. Computational complexity of art gallery problems. Information Theory, IEEE Transactions on, 32(2):276-282, 1986.
18. H. Liu, J. Li, Z. Xie, S. Lin, K. Whitehouse, J. A. Stankovic, and D. Siu. Automatic and robust breadcrumb system deployment for indoor firefighter applications. In Proceedings of the 8th international conference on Mobile systems, applications, and services, pages 21-34. ACM, 2010.
19. M. Luca and K. Kooi. Angstrom Manual. Embedded Power, 2010.
20. C. S. Mata and J. S. B. Mitchell. Approximation algorithms for geometric tour and network design problems (extended abstract). In Proceedings of the eleventh annual symposium on Computational geometry, SCG '95, pages 360-369, New York, NY, USA, 1995. ACM.
21. A. Mittal and L. S. Davis. Visibility analysis and sensor planning in dynamic environments. In Computer Vision-ECCV 2004, pages 175-189. Springer, 2004.
22. A. T. Murray, K. Kim, J. W. Davis, R. Machiraju, and R. Parent. Coverage optimization to support security monitoring. Computers, Environment and Urban Systems, 31(2):133-147, 2007.
23. B. J. Nilsson and S. Carlsson. Guarding art galleries: Methods for mobile guards. 1994.
24. J. O'rourke. Art gallery theorems and algorithms, volume 1092. Oxford University Press Oxford, 1987.
25. S. Ram, K. Ramakrishnan, P. Atrey, V. Singh, and M. Kankanhalli. 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, pages 121-130. ACM, 2006.
26. X. TAN. Corrigendum to an incremental algorithm for constructing shortest watchman routes. Int. J. Comput. Geom. Appl., 9:319-323, 1999.
27. X. Tan. Fast computation of shortest watchman routes in simple polygons. Information Processing Letters, 77(1):27-33, 2001.
28. X. Tan. Fast computation of shortest watchman routes in simple polygons. Information Processing Letters, 77(1):27-33, 2001.
29. X. Tan, T. Hirata, and Y. Inagaki. An incremental algorithm for constructing shortest watchman routes. International Journal of Computational Geometry & Applications, 3(04):351-365, 1993.
30. J. Urrutia. Art gallery and illumination problems. Handbook of computational geometry, pages 973-1027, 2000.
31. Y. Yao, C.-H. Chen, B. Abidi, D. Page, A. Koschan, and M. Abidi. Sensor planning for automated and persistent object tracking with multiple cameras. In Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on, pages 1-8. IEEE, 2008.
32. Y. Yao, C.-H. Chen, B. Abidi, D. Page, A. Koschan, and M. Abidi. Can you see me now? sensor positioning for automated and persistent surveillance. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on, 40(1):101-115, 2010.
33. J. Zhao, S. Cheung, et al. Multi-camera surveillance with visual tagging and generic camera placement. In Distributed Smart Cameras, 2007. ICDSC'07. First ACM/IEEE International Conference on, pages 259-266. IEEE, 2007.