Abstract
Intrusion detection, area coverage and border surveillance are important applications of wireless sensor networks today. They can be (and are being) used to monitor large unprotected areas so as to detect intruders as they cross a border or as they penetrate a protected area. We consider the problem of how to optimally move mobile sensors to the fence (perimeter) of a region delimited by a simple polygon in order to detect intruders from either entering its interior or exiting from it. We discuss several related issues and problems, propose two models, provide algorithms and analyze their optimal mobility behavior.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahmed, N., Kanhere, S.S., Jha, S.: The holes problem in wireless sensor networks: a survey. ACM SIGMOBILE Mobile Computing and Communications Review 9(2), 4–18 (2005)
Balister, P., Bollobas, B., Sarkar, A., Kumar, S.: Reliable density estimates for coverage and connectivity in thin strips of finite length. In: Proceedings of the 13th annual ACM international conference on Mobile computing and networking, pp. 75–86 (2007)
Chen, A., Kumar, S., Lai, T.H.: Designing localized algorithms for barrier coverage. In: Proceedings of the 13th annual ACM international conference on Mobile computing and networking, pp. 63–74 (2007)
Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM (JACM) 34(1), 200–208 (1987)
Heo, N., Varshney, P.K.: A distributed self spreading algorithm for mobile wireless sensor networks. In: Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE, vol. 3 (2003)
Heo, N., Varshney, P.K.: Energy-efficient deployment of Intelligent Mobile sensor networks. Systems, Man and Cybernetics, Part A, IEEE Transactions on 35(1), 78–92 (2005)
Hopcroft, J.E., Karp, R.M.: An n 2.5 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2(4), 225–231 (1973)
Hu, S.S.: ’Virtual Fence’ along border to be delayed. Washington Post, Thursday (February 28, 2008)
Jung, B., Sukhatme, G.S.: Tracking Targets Using Multiple Robots: The Effect of Environment Occlusion. Autonomous Robots 13(3), 191–205 (2002)
Kuhn, H.W.: The Hungarian Method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97 (1955)
Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. Wireless Networks 13(6), 817–834 (2007)
Liu, J., Cheung, P., Zhao, F., Guibas, L.: A dual-space approach to tracking and sensor management in wireless sensor networks. In: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, pp. 131–139 (2002)
Megiddo, N.: Applying Parallel Computation Algorithms in the Design of Serial Algorithms. Journal of the ACM (JACM) 30(4), 852–865 (1983)
O’Rourke, J.: Art gallery theorems and algorithms. Oxford University Press, Inc., New York (1987)
Schrijver, A.: Disjoint circuits of prescribed homotopies in a graph on a compact surface. Journal of Combinatorial Theory Series B 51(1), 127–159 (1991)
Se, S., Lowe, D., Little, J.: Mobile Robot Localization and Mapping with Uncertainty using Scale-Invariant Visual Landmarks. The International Journal of Robotics Research 21(8), 735 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhattacharya, B., Burmester, B., Hu, Y., Kranakis, E., Shi, Q., Wiese, A. (2008). Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region . In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)