A Node Scheduling Scheme Based on Coverage-Preserving for Wireless Sensor Network

An effective approach for energy conservation in wireless sensor networks is to schedule sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. In this paper, we proposed a new scheme based on Monte Carlo algorithm to test whether the nodes deployed in interested region are redundant or not. The computational complexity is only O(n). It also established the coverage collision detection and back-off mechanism applied in the wireless sensor network. The simulation results show that the system can cover all the interested area with least nodes and the coverage void will not appear during the course of state- transition. The coverage collision detection and back-off mechanism proposed in this article can be applied when the nodes both have synchronous and asynchronous mechanism. It also provides a stable stage with the length of the time can be adjusted.