Maintaining Coverage Node Scheduling Algorithm in Wireless Sensor Network

Scheduling the redundant nodes to sleep is an effective technology to sufficiently prolong the life circle of wireless sensor network on the premise of meeting the coverage quality. According to position distribution of the neighboring nodes, a node scheduling algorithm of wireless sensor network is proposed on the basis of the necessary condition that a node becomes a redundant one and whether the complementary neighboring nodes meet the circle cover. The new algorithm reduces the computational complexity. Simulation results show that the new algorithm is effective to schedule the redundant node to sleep for energy-saving. It predicates nearly 26 % nodes to sleep when the perception radius is 10 meters and coverage rate is unchanged. It identifies more than 50 % nodes to sleep with 15 meters radius.