A Cluster-Based Coverage-Preserved Node Scheduling Scheme in Wireless Sensor Networks

Abstract

Wireless sensor networks consist of a large number of low-power, small-scale sensors with limited processing and communication capabilities. Such networks are usually applied to gather data from interested area or specific environment and deliver to remote users for analyzing or monitoring. Because of sensing devices are usually powered by batteries, it is a great challenge to meet the performance of long system lifetime required by different applications under limited power. In the densely deployed sensor networks, the area or data sensed by neighboring sensors may overlap. In recent researches, coverage preserved node scheduling has been proposed to conserve power and provide sensing reliability. By selecting appropriate sensors into sleep state, the system lifetime can be extended without losing coverage. In this paper, we propose a duster-based coverage-preserved node scheduling scheme. We divide sensors into clusters and group cluster members into sponsor sets based on neighbor information. The proposed approach distributes the workloads among sponsor set nodes and ensures sufficient coverage as long as possible