Paper Info
Title
Poster: Quadratic-Time Algorithms for Optimal Min-Max Barrier Coverage with Mobile Sensors on the Plane
Abstract
Emerging applications impose the min-max line barrier coverage (LBC) problem that aims to minimize the maximum movement of the sensors for the sake of balancing energy consumption. In the paper, we devise an algorithm for LBC that finds an optimal solution within a runtime O (n(2)), improving the previous state-of-art runtime O (n(2) log n) due to [7]. The key idea to accelerating the computation of the optimum solutions is to use approximation solutions that are obtained by our devised approximation algorithm. Numerical experiments demonstrate our algorithms outperform all the other baselines including the previous state-of-art algorithm.
Year
DOI
Venue
2021
10.1109/ICDCS51616.2021.00122
2021 IEEE 41ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2021)
Keywords
DocType
ISSN
Fast algorithm, barrier coverage, optimal solution, mobile sensor, approximation algorithm
Conference
1063-6927
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Pei Yao101.01
Longkun Guo200.34
Jiguo Yu3688108.74