Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region

Authors:
B. Bhattacharya;B. Burmester;Y. Hu;E. Kranakis;Q. Shi;A. Wiese
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, Canada;Department of Computer Science, Florida State University, Talahassee, USA;School of Computing Science, Simon Fraser University, Burnaby, Canada;School of Computer Science, Carleton University, Ottawa, Canada;School of Computing Science, Simon Fraser University, Burnaby, Canada;Institut für Mathematik, Technische Universität Berlin, Berlin, Germany
Venue:
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Year:
2008

Citing 11
Cited 4

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Art gallery theorems and algorithms

Art gallery theorems and algorithms
Disjoint circuits of prescribed homotopies in a graph on a compact surface

Journal of Combinatorial Theory Series B
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
A dual-space approach to tracking and sensor management in wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Tracking Targets Using Multiple Robots: The Effect of Environment Occlusion

Autonomous Robots
The holes problem in wireless sensor networks: a survey

ACM SIGMOBILE Mobile Computing and Communications Review
Designing localized algorithms for barrier coverage

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Reliable density estimates for coverage and connectivity in thin strips of finite length

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Barrier coverage with wireless sensors

Wireless Networks
Energy-efficient deployment of Intelligent Mobile sensor networks

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment

ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
The intrusion detection in mobile sensor network

Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
On minimizing the sum ofensor movements for barrier coverage of a line segment

ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
The intrusion detection in mobile sensor network

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

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.