The Mobile Sensor Deployment Problem and the Target Coverage Problem in Mobile Wireless Sensor Networks are NP-Hard

The Mobile Sensor Deployment Problem and the Target Coverage Problem in Mobile Wireless Sensor Networks are NP-Hard

Recently, the problem of scheduling mobile sensors to cover all targets and maintain network connectivity such that the total movement distance is minimized, termed the mobile sensor deployment (MSD) problem, has received a great deal of attention. However, the complexity of the MSD problem remains...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE systems journal 2019-06, Vol.13 (2), p.1312-1315
Hauptverfasser: Nguyen, Ngoc-Tu, Liu, Bing-Hong
Format: Artikel
Sprache:eng
Schlagworte:
Data communication
Indexes
Mobile wireless sensor network (MWSN)
network connectivity
NP-hard
NP-hard problem
polynomial-time reduction
Remote sensors
Schedules
Sensors
target coverage (TCOV)
Wireless sensor networks
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Recently, the problem of scheduling mobile sensors to cover all targets and maintain network connectivity such that the total movement distance is minimized, termed the mobile sensor deployment (MSD) problem, has received a great deal of attention. However, the complexity of the MSD problem remains unknown because no exact proof has been provided before. In this paper, we show that not only the MSD problem, but also its special case, termed the target coverage problem, are NP-hard.
ISSN:1932-8184
1937-9234
DOI:10.1109/JSYST.2018.2828879