Coverage Properties of the Target Area in Wireless Sensor Networks
Artikel i vetenskaplig tidskrift, 2012

An analytical approximation is developed for the probability of sensing coverage in a wireless sensor network with randomly deployed sensor nodes each having an isotropic sensing area. This approximate probability is obtained by considering the properties of the geometric graph, in which an edge exists between any two vertices representing sensor nodes with overlapping sensing areas. The principal result is an approximation to the proportion of the sensing area that is covered by at least one sensing node, given the expected number of nodes per unit area in a two-dimensional Poisson process. The probability of a specified region being completely covered is also approximated. Simulation results corroborate the probabilistic analysis with low error, for any node density. The relationship between this approximation and noncoverage by the sensors is also examined. These results will have applications in planning and design tools for wireless sensor networks, and studies of coverage employing computational geometry.



geometric graph

Poisson process




X. Y. Li

Shenzhen Institute of Advanced Technology

D. K. Hunter

University of Essex

Sergey Zuev

Chalmers, Matematiska vetenskaper, matematisk statistik

Göteborgs universitet

IEEE Transactions on Information Theory

0018-9448 (ISSN)

Vol. 58 430-437



Sannolikhetsteori och statistik