Complexity of barrier coverage with relocatable sensors in the plane

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

Volumn 7878 LNCS, Issue , 2013, Pages 170-182

  Dobrev, Stefan ^a   Durocher, Stephane ^b   Eftekhari, Mohsen ^c   Georgiou, Konstantinos ^d   Kranakis, Evangelos ^e   Krizanc, Danny ^f   Narayanan, Lata ^c   Opatrny, Jaroslav ^c   Shende, Sunil ^g   Urrutia, Jorge ^h  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

^b UNIVERSITY OF MANITOBA   (Canada)

^c Civil and Environmental Engineering   (Canada)

^d UNIVERSITY OF WATERLOO   (Canada)

^e CARLETON UNIVERSITY   (Canada)

^f WESLEYAN UNIVERSITY   (United States)

^g RUTGERS UNIVERSITY   (United States)

^h UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY POSITIONS; BARRIER COVERAGES; FEASIBILITY PROBLEM; LINE SEGMENT; MIN-SUM; NP COMPLETE; POLYNOMIAL-TIME; SENSING RANGES;

ALGORITHMS; POLYNOMIAL APPROXIMATION;

SENSORS;

EID: 84883385926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38233-8_15     Document Type: Conference Paper

References (11)

1. Balister, P., Bollobas, B., Sarkar, A., Kumar, S.: Reliable density estimates for coverage and connectivity in thin strips of finite length. In: Proceedings of MobiCom 2007, pp. 75-86 (2007)
2. Bhattacharya, B., Burmester, M., Hu, Y., Kranakis, E., Shi, Q.,Wiese, A.: Optimal movement of mobile sensors for barrier coverage of a planar region. Theoretical Computer Science 410(52), 5515-5528 (2009)
3. Chen, D.Z., Gu, Y., Li, J., Wang, H.: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 177-188. Springer, Heidelberg (2012)
4. Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the maximum sensor movement for barrier coverage of a line segment. In: Ruiz, P.M., Garcia- Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 194-212. Springer, Heidelberg (2009)
5. Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On minimizing the sum of sensor movements for barrier coverage of a line segment. In: Nikolaidis, I., Wu, K. (eds.) ADHOC-NOW 2010. LNCS, vol. 6288, pp. 29-42. Springer, Heidelberg (2010)
6. Gold, E.M.: Complexity of automaton identification from given data. Information and Control 37(3), 302-320 (1987)
7. Huang, C.F., Tseng, Y.C.: The coverage problem in a wireless sensor network. In: Proceedings of WSNA, pp. 115-121 (2003)
8. Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: Proceedings of MobiCom 2005, pp. 284-298 (2005)
9. Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: Proceedings of INFOCOM 2001, vol. 3, pp. 1380-1387 (2001)
10. Mehrandish, M., Narayanan, L., Opatrny, J.: Minimizing the number of sensors moved on line barriers. In: Proceedings of IEEE WCNC 2011, pp. 1464-1469 (2011)
11. Yan, G., Qiao, D.: Multi-round sensor deployment for guaranteed barrier coverage. In: Proceedings of IEEE INFOCOM 2010, pp. 2462-2470 (2010)