.png){kind=icon}
返回
Information coverage in randomly deployed wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2007.051044.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
coverage
information coverage
sensor density
wireless sensor networks
parameter estimation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
Opisthorchis viverrini infection in Northeast Thailand and its relationship to cholangiocarcinoma
PREAI
分享收藏Crystal structure refinement and reflectance measurements of hausmannite, Mn3O4hausmannite，Mn3O4的晶体结构细化和反射率测量
PREAI
分享收藏
查看更多内容