Hops-based Sleep Scheduling Algorithm for Enhancing Lifetime of Wireless Sensor Networks

In this paper, we study the node sleep scheduling scheme in the commonly used static disk model for sensor networks, where homogenous sensors are uniformly distributed in a circular area with a stationary sink located at the center. Then, we introduce and analyze a hops-based sleeping scheduling algorithm (HSS) for enhancing the lifetime and energy efficiency of the sensor networks. The HSS divides the circular sensor network into several levels according to the average hop distance based on certain network parameters. By assigning hops-based sleeping probabilities to each sensor, and the network lifetime as well as energy efficiency can be greatly improved. Simulations are performed to compare our proposed HSS scheme with the traditional randomized sleeping scheduling (RSS) scheme, where all the nodes have the uniform sleeping probability. The results demonstrate that our HSS scheme can enhance network lifetime greatly, provide desired QoS requirement effectively, and drastically outperform the RSS scheme