Probabilistic Coverage Configuration for Wireless Sensor Networks

Recently, wireless sensor networks have attracted a lot of attention. Such environments may consist of many inexpensive nodes, each capable of collecting, storing, processing environmental information and communicating with neighboring nodes through wireless links. In this paper, we investigate the coverage issues in wireless sensor networks based on probabilistic coverage and propose a probabilistic coverage to evaluate the problem of the point coverage. The algorithm takes into account the variations in sensing factors of deployed sensors and adopts a probabilistic approach in contrast to widely used idealistic unit disk model. Simulation results show the CCAP algorithm is more efficient than the binary detecting model