An Efficient Method for Sweep Coverage with Minimum Mobile Sensor
- 1 August 2014
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing
- p. 289-292
- https://doi.org/10.1109/iih-msp.2014.78
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.Keywords
This publication has 10 references indexed in Scilit:
- Sweep Coverage with Mobile SensorsIEEE Transactions on Mobile Computing, 2011
- On Sweep Coverage with Minimum Mobile SensorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Deploying Four-Connectivity and Full-Coverage Wireless Sensor NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Designing localized algorithms for barrier coveragePublished by Association for Computing Machinery (ACM) ,2007
- Reliable density estimates for coverage and connectivity in thin strips of finite lengthPublished by Association for Computing Machinery (ACM) ,2007
- Distributed algorithms for dynamic coverage in sensor networksPublished by Association for Computing Machinery (ACM) ,2007
- Coverage by randomly deployed wireless sensor networksIEEE Transactions on Information Theory, 2006
- Barrier coverage with wireless sensorsPublished by Association for Computing Machinery (ACM) ,2005
- On k-coverage in a mostly sleeping sensor networkPublished by Association for Computing Machinery (ACM) ,2004
- The coverage problem in a wireless sensor networkPublished by Association for Computing Machinery (ACM) ,2003