|
|||||
|
|
Optimal movement of mobile sensors for barrier coverage of a planar region |
|
| Authors: | Binay Bhattacharya Mike Burmester Yuzhuang Hu Evangelos Kranakis Qiaosheng Shi Andreas Wiese |
| Affiliation: | aSchool of Computing Science, Simon Fraser University, Vancouver, BC, Canada;bDepartment of Computer Science, Florida State University, Tallahassee, Florida, USA;cSchool of Computer Science, Carleton University, 1125 Colonel By Drive, K1S 5B6 Ottawa, Ontario, Canada;dInstitut für Mathematik, Technische Universität Berlin, Berlin, Germany |
| 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. |
| Keywords: | Barrier coverage Circle Line Mobile robots Minimize max Minimize sum Optimal movement sensors |
| 本文献已被 ScienceDirect 等数据库收录！ | |