A distributed activity scheduling algorithm for wireless sensor networks with partial coverage

One of the most important design objectives in wireless sensor networks (WSN) is minimizing the energy consumption since these networks are expected to operate in harsh conditions where the recharging, of batteries is impractical, if not impossible. The sleep scheduling mechanism allows sensors to sleep Intermittently In order to reduce energy consumption and extend network lifetime. In applications where 100% coverage of the network field is not crucial. allowing the coverage to drop below full coverage while keeping above I predetermined threshold, i.e., partial coverage, call further increase the network lifetime. In this paper, we develop the distributed adaptive sleep scheduling algorithm (DASSA) for WSNs with partial coverage DASSA does not require location Information of sensors while maintaining connectivity and satisfying a User defined coverage target. In DASSA, nodes use the residual energy levels and feedback from the sink for scheduling the activity of their neighbors This feedback mechanism reduces the randomness in scheduling that would otherwise occur due to the absence of location Information. The performance of DASSA is compared with ail integer linear programming (H-P) based centralized sleep scheduling algorithm (CSSA), which is devised to find the maximum number of rounds the network call survive assuming that the location information of all sensors is available DASSA is also compared with the decentralized DGT algorithm. DASSA attains network lifetimes LIP to 92% of the centralized solution and it achieves significantly longer lifetimes compared with the DGT algorithm