An Efficient Method for Sweep Coverage with Minimum Mobile Sensor

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.