### Skapa referens, olika format (klipp och klistra)

**Harvard**

Li, X., Hunter, D. och Zuyev, S. (2012) *Coverage Properties of the Target Area in Wireless Sensor Networks*.

** BibTeX **

@article{

Li2012,

author={Li, X. Y. and Hunter, D. K. and Zuyev, Sergei},

title={Coverage Properties of the Target Area in Wireless Sensor Networks},

journal={Ieee Transactions on Information Theory},

issn={0018-9448},

volume={58},

issue={1},

pages={430-437},

abstract={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.},

year={2012},

keywords={Coverage, dimensioning, geometric graph, networks, Poisson process, sensor },

}

** RefWorks **

RT Journal Article

SR Electronic

ID 154854

A1 Li, X. Y.

A1 Hunter, D. K.

A1 Zuyev, Sergei

T1 Coverage Properties of the Target Area in Wireless Sensor Networks

YR 2012

JF Ieee Transactions on Information Theory

SN 0018-9448

VO 58

IS 1

SP 430

OP 437

AB 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.

LA eng

DO 10.1109/TIT.2011.2169300

LK http://dx.doi.org/10.1109/TIT.2011.2169300

OL 30