Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain

Authors:
Danny Z. Chen;Yan Gu;Jian Li;Haitao Wang
Affiliations:
Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Institute for Interdisciplinary Information Sciences (IIIS), Tsinghua University, Beijing, China;Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN
Venue:
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Year:
2012

Citing 14
Cited 2

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
A Distributed Coverage- and Connectivity-Centric Technique for Selecting Active Nodes in Wireless Sensor Networks

IEEE Transactions on Computers
Designing localized algorithms for barrier coverage

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

Wireless Networks
Localized sensor self-deployment with coverage guarantee

ACM SIGMOBILE Mobile Computing and Communications Review
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
Optimal movement of mobile sensors for barrier coverage of a planar region

Theoretical Computer Science
New algorithms for barrier coverage with mobile sensors

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
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
Representing a Functional Curve by Curves with Fewer Peaks

Discrete & Computational Geometry
Minimum-cost linear coverage by sensors with adjustable ranges

WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Scan-Based Movement-Assisted Sensor Deployment Methods in Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems

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	0.00

Visualization

Abstract

In this paper, we study the problem of moving n sensors on a line to form a barrier coverage of a specified segment of the line such that the maximum moving distance of the sensors is minimized. Previously, it was an open question whether this problem on sensors with arbitrary sensing ranges is solvable in polynomial time. We settle this open question positively by giving an O(n2lognloglogn) time algorithm. Further, if all sensors have the same-size sensing range, we give an O(nlogn) time algorithm, which improves the previous best O(n2) time solution.