Sweep Coverage Mechanism for Wireless Sensor Networks with Approximate Patrol Times

The coverage problem is a fundamental and important issue with regard to wireless sensor networks. To reduce the number of sensor nodes, mobile nodes can be used to mitigate the sweep coverage problem. In this paper, a sweep coverage mechanism is proposed to keep the patrol times of mobile nodes approximate to one another. In simulation, various moving speeds and waiting times of mobile nodes are considered. Simulation results attest to the feasibility of the proposed method.