.png){kind=icon}
Return
Information coverage in randomly deployed wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2007.051044.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Coverage is an important issue. in wireless sensor networks. The most commonly used coverage model in the literature defines a point to be covered if its Euclidian distance to at least one sensor is less than a fixed threshold. This is a conservative definition of coverage which implicitly assumes that each sensor makes a decision independent of other sensors in the field. Sensors can cooperate to make an accurate estimation, even if any single sensor is unable to do so. We have previously proposed a new notion of information coverage [1] and investigated its properties. In this paper, we study sensor density requirements for complete information coverage of a field with,random sensor deployment. We provide an upper bound on the probability that an arbitrary point in a randomly deployed sensor field is not information covered and find the relationship between the sensor density and the average field vacancy. Simulation results validate our theoretical analysis and show that significant savings in terms of sensor density for complete coverage can be achieved with information coverage.
Keywords:
coverage
information coverage
sensor density
wireless sensor networks
parameter estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveOpisthorchis viverrini infection in Northeast Thailand and its relationship to cholangiocarcinoma
PREAI
ShareSaveShareSave
View more