Sweep coverage optimization for mobile sensor networks in multi-obstacles scene

In the application of mobile wireless sensor network, the coverage analysis of sensor nodes usually is a sweep coverage problem for target area. In order to reduce the probability of the energy consumption and prolong mobile sensor's life cycle, we propose an optimized sweep coverage algorithm, this algorithm could get optimal path of a node in the target area. The mobile sensor nodes diverged from a single location to multiple locations, and a single mobile sensor node was used instead of multiple fixed sensor nodes to sweep the target area. For the target area with obstacles, the method of unlocking is used to complete the maximum coverage optimization of the shortest time. We adopt dual objective optimization strategy to carry out path planning for single mobile sensor nodes. Using this algorithm, on the one hand, the mobile sensor nodes could get the maximum coverage area, on the other hand the path covered by the sweep is the shortest. Extensive simulation experiments are conducted to study the path length under two situations with obstacles and without obstacles.