.png){kind=icon}
返回
Coverage for target localization in wireless sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2008.060611.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Target tracking and localization are important applications in wireless sensor networks. Although the coverage problem for target detection has been intensively studied, few consider the coverage problem from the perspective of target localization. In this paper, we propose two methods to estimate the lower bound of sensor density to guarantee a bounded localization error over the sensing field. We first convert the coverage problem for localization to a conventional disk coverage problem, where the sensing area is a disk centered at the sensor. Our results show that the disk coverage model requires 4 times more sensors for localization compared to detection applications. We then introduce the idea of sector coverage to tighten the lower bound. The lower bound derived through sector coverage is 2 times less than through disk coverage. A distributed sector coverage algorithm is then proposed in this paper. Compared to disk coverage, sector coverage requires more computations. However, it provides more accurate density estimations than the disk model. Numerical evaluations show that the density bound derived through our sector coverage model is tight.
Keyword:
sensor networks
coverage
localization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容