Accuracy Of Range-Based Localization Schemes In Random Sensor Networks: A Lower Bound Analysis

2013 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS)(2013)

引用 25|浏览11
暂无评分
摘要
Accuracy is a fundamental performance requirement in network localization. This paper studies the accuracy of range-based localization schemes for random sensor networks with respect to network connectivity and scale. We show that the variance of localization errors is proportional to the average geometric dilution of precision (AGDOP). The paper proves a novel lower bound of expectation of AGDOP (LB-E-AGDOP). Our analysis based on LB-E-AGDOP shows that localization accuracy is approximately inversely proportional to the average degree of network. A further analysis shows that when network connectivity merely guarantees localizability, increasing sensor nodes leads to bounded monotonic increase in AGDOP; when a network is densely connected, increasing sensor nodes leads to bounded monotonic decrease in AGDOP. Finally, these conclusions are validated by numerical simulations.
更多
查看译文
关键词
statistical analysis,graph theory,robots,sensors
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要