Optimal algorithm for min-max line barrier coverage with mobile sensors on 2-dimensional plane

Emerging IoT applications impose line barrier coverage (LBC) tasks with min–max movement objective due to requirements of energy balance, fairness, etc. In LBC, we are given a line barrier and a set of n sensors distributed on the plane. The aim is to move the sensors to fully cover the given barrie...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer networks (Amsterdam, Netherlands : 1999) Jg. 228; S. 109717
Hauptverfasser: Yao, Pei, Guo, Longkun, Li, Peng, Lin, Jiawei
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.06.2023
Schlagworte:
Approximation algorithm
Barrier coverage
Exact algorithm
Mobile sensor
Optimal solution
Mobile sensor
Barrier coverage
Exact algorithm
Approximation algorithm
Optimal solution
ISSN:1389-1286, 1872-7069
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Emerging IoT applications impose line barrier coverage (LBC) tasks with min–max movement objective due to requirements of energy balance, fairness, etc. In LBC, we are given a line barrier and a set of n sensors distributed on the plane. The aim is to move the sensors to fully cover the given barrier, such that the maximum movement of the mobile sensors is minimized and hence the energy consumption of the sensors are balanced. This paper proposes an exact algorithm to optimally solve LBC, which deserves a runtime On2 compared favorably to the previous state-of-art runtime On2logn. The key idea of the improvement is acceleration-via-approximation: devise a novel approximation algorithm and then use it to accelerate the calculation of optimum solutions. Extensive numerical experiments were carried out to evaluate the practical performance of our algorithm against other baselines, demonstrating its performance gain over the previous state-of-art algorithms.
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2023.109717