Photo by jpvalery from unsplash
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,… Click to show full abstract
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.
Keywords:
mobile sensor;
sensor deployment;
problem;
coverage problem;
target coverage;
sensor
Journal Title: IEEE Systems Journal
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: IEEE Systems Journal
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!