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.

Additional Metadata
Keywords Barrier coverage, Circle, Line, Minimize max, Minimize sum, Mobile robots, Optimal movement sensors
Persistent URL dx.doi.org/10.1016/j.tcs.2009.07.007
Journal Theoretical Computer Science
Citation
Bhattacharya, B. (Binay), Burmester, M. (Mike), Hu, Y. (Yuzhuang), Kranakis, E, Shi, Q. (Qiaosheng), & Wiese, A. (Andreas). (2009). Optimal movement of mobile sensors for barrier coverage of a planar region. Theoretical Computer Science, 410(52), 5515–5528. doi:10.1016/j.tcs.2009.07.007