A Distributed Probabilistic-Coverage Node Scheduling Scheme for Large Wireless Sensor Networks

In wireless sensor networks, coverage configuration is an important issue which can prolong the system lifetime significantly. Most of current literatures are based on physical coverage, i.e. deterministic detection model, which is inconsistent with the realistic application of wireless sensor networks. A distributed probabilistic coverage configuration protocol (DPCCP) is proposed in this paper. It adopts Neyman-Peason probabilistic detection model to decide whether nodes can be off or not. Our DPCCP guarantees that the system detection probability is maintained after turning off lots of unnecessary nodes. We extend LEACH by embedding DPCCP into LEACH (namely LEACHE) seamlessly without any modification of the original workflow. Simulation results show that DPCCP can effectively reduce the number of active sensor nodes, and LEACHE outperforms LEACH in terms of system lifetime and energy efficiency.