High-Density Randomly Deployed Nodes Sleep Scheduling Algorithm in Wireless Sensor Networks

The high-density randomly deployment of nodes in Wireless Sensor Networks results in a large number of redundant nodes due to the overlap of sensing areas. A scheduling algorithm for redundant nodes is proposed to effectively prolong the lifetime of WSN. The algorithm focuses on employing different scheduling strategies on border nodes and internal nodes to avoid contraction of the network boundary by judging whether a node is on the network boundary according to the number of working nodes in its neighbor table. The simulation results show that the algorithm can effectively prolong the lifetime of the network.