Optimal movement of mobile sensors for barrier coverage of a planar region (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5165 LNCS, Issue , 2008, Pages 103-115

  Bhattacharya, B ^a   Burmester, B ^b   Hu, Y ^a   Kranakis, E ^c   Shi, Q ^a   Wiese, A ^d  

^a SIMON FRASER UNIVERSITY   (Canada)

^b Florida State University   (United States)

^c CARLETON UNIVERSITY   (Canada)

^d TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BEVERAGES; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; ENVIRONMENTAL PROTECTION; INTRUSION DETECTION; OPTIMIZATION; SENSOR NETWORKS; SENSORS; UNMANNED AERIAL VEHICLES (UAV);

INTERNATIONAL CONFERENCES; MOBILE SENSORS; MOBILITY BEHAVIOR; PLANAR REGIONS; PROTECTED AREAS; SIMPLE POLYGON;

WIRELESS SENSOR NETWORKS;

EID: 51849140412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85097-7_10     Document Type: Conference Paper

References (16)

1. 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)
2. 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)
3. 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)
4. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. Journal of the ACM (JACM) 34(1), 200-208 (1987)
5. 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)
6. 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)
7. 2.5 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2(4), 225-231 (1973)
8. Hu, S.S.: 'Virtual Fence' along border to be delayed. Washington Post, Thursday (February 28, 2008)
9. Jung, B., Sukhatme, G.S.: Tracking Targets Using Multiple Robots: The Effect of Environment Occlusion. Autonomous Robots 13(3), 191-205 (2002)
10. Kuhn, H.W.: The Hungarian Method for the assignment problem. Naval Research Logistics Quarterly 2, 83-97 (1955)
11. Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. Wireless Networks 13(6), 817-834 (2007)
12. 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)
13. Megiddo, N.: Applying Parallel Computation Algorithms in the Design of Serial Algorithms. Journal of the ACM (JACM) 30(4), 852-865 (1983)
14. O'Rourke, J.: Art gallery theorems and algorithms. Oxford University Press, Inc., New York (1987)
15. 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)
16. 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)