Abstract
Recently, sweep coverage, which is the problem of scheduling mobile sensors to periodically visit a certain number of points of interests (POIs) such that the number of mobile sensors is minimized and each of POIs can be visited periodically within a given time period, has received a great deal of attention in the wireless sensor networks. Many methods have been proposed for the sweep coverage to minimize the number of employed mobile sensors. In addition, the sweep coverage is shown to be NP-complete. In this paper, we propose a heuristic, called the perpendicular-distance-based algorithm (PDBA), to minimize the number of employed mobile sensors and the total energy consumed by the mobile sensors. Simulation results show that the PDBA has better performance than other existing methods.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - 2014 10th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2014 |
Editors | Junzo Watada, Akinori Ito, Jeng-Shyang Pan, Han-Chieh Chao, Chien-Ming Chen |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 289-292 |
Number of pages | 4 |
ISBN (Electronic) | 9781479953905 |
DOIs | |
State | Published - Dec 24 2014 |
Event | 10th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2014 - Kitakyushu, Japan Duration: Aug 27 2014 → Aug 29 2014 |
Publication series
Name | Proceedings - 2014 10th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2014 |
---|
Other
Other | 10th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2014 |
---|---|
Country/Territory | Japan |
City | Kitakyushu |
Period | 8/27/14 → 8/29/14 |
Bibliographical note
Publisher Copyright:© 2014 IEEE.
Keywords
- NP-complete
- mobile sensor
- sweep coverage