Areas covered with Probability Bound in wireless sensor networks

Wireless sensor networks are composed of a large number of geographically distributed sensor nodes. The goal of deployment is to optimize the number of sensors involved in coverage task while keeping preserving area coverage c. This paper addresses Areas Covered with Probability Bound. Given the system parameters, this paper provides a probability bound that estimates the likeliness of the uncovered areas. The paper find that the probability bound is equal to the probability that no sensor is found in a corresponding circle. Numerical results are included to show the relation along with various system parameters. And the conclusion can be applied to the algorithm design sensors for the detection of and screening, or routing purposes.