Probabilistic based k-coverage configuration in large-scale sensor networks

In wireless sensor networks, coverage is an important measurement of quality of service (Qos). In this paper, a k-coverage configuration protocol based on the probabilistic detection model (Pro-CCP) is proposed. Pro-CCP is fully distributed and localized. Using our previous work named coverage eligible rule (CER), the proposed protocol is able to configure sensors into several disjoint active sets, each of which can maintain the monitoring area being covered no less than probabilistic γ. In addition, the scheduling scheme after the coverage configuration is presented in details. Simulations and analysis show us that Pro-CCP is a robust algorithm that can configure network coverage for various requirements, and it outperforms than the CCP on the ability of turning off redundant nodes.