Abstract. In order to conserve battery power in very dense sensor networks, some sensor nodes may be put into the sleep state while other sensor nodes remain active for the sensing and communication tasks. In this paper, we study the node sleep scheduling problem in the context of clustered sensor networks. We propose and analyze the Linear Distance-based Scheduling (LDS) technique for sleeping in each cluster. The LDS scheme selects a sensor node to sleep with higher probability when it is farther away from the cluster head. We analyze the energy consumption, the sensing coverage property, and the network lifetime of the proposed LDS scheme. The performance of the LDS scheme is compared with that of the conventional Randomized Scheduling (RS) scheme. It is shown that the LDS scheme yields more energy savings while maintaining a similar sensing coverage as the RS scheme for sensor clusters. Therefore, the LDS scheme results in a longer network lifetime than the RS scheme.
In REF , the authors proposes a technique called "linear distance-based scheduling" of the sleep/running mode of every sensor to reduce power use.
Scheduling sleeping nodes in high density cluster-based sensor networks
ACM/Kluwer Mobile Networks and Applications (MONET) Special Issue on ”Energy Constraints and Lifetime Performance in Wireless Sensor Networks
Computer Science