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
Affiliations:
School of Computing Science, Simon Fraser University, Vancouver, BC, Canada;Department of Computer Science, Florida State University, Tallahassee, Florida, USA;School of Computing Science, Simon Fraser University, Vancouver, BC, Canada;School of Computer Science, Carleton University, 1125 Colonel By Drive, K1S 5B6 Ottawa, Ontario, Canada;School of Computing Science, Simon Fraser University, Vancouver, BC, Canada;Institut für Mathematik, Technische Universität Berlin, Berlin, Germany
Venue:
Theoretical Computer Science
Year:
2009

Citing 11
Cited 5

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

New algorithms for barrier coverage with mobile sensors

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Optimal sensor networks for area monitoring using rotating and beam sensors

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Distributed algorithms for barrier coverage using relocatable sensors

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	5.23

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.