.png){kind=icon}
返回
A Historical-Beacon-Aided Localization Algorithm for Mobile Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2014.2346777.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Range-free localization approaches are cost-effective for mobile sensor networks (because no additional hardware support is required). However, existing range-free localization approaches for mobile sensor networks suffer from either sparse anchor node problem or high communication cost. Due to economic considerations, mobile sensor networks typically have sparse anchor nodes which makes most range-free localization algorithms inaccurate. On the other hand, due to the power limitation of mobile sensor nodes (i.e., they are battery-operated) and high power consumption by communication, high communication cost will significantly reduce the network life time. For solving these two problems, in this paper, we use historical beacons (i.e., anchor nodes' announcements delivered in previous time slots) and received signal strength (RSS) to derive three constraints. By the aid of the three constraints, we introduce a low-communication-cost range-free localization algorithm (only one-hop beacon broadcasting is required). According to the theoretical analysis and simulation results, our three constraints can indeed improve the accuracy. Simulation results also show that our algorithm outperforms even in irregular-radio-signal environments. In addition, a hardware implementation running on sensor nodes, Octopus Xs, confirms theoretical analysis and simulation results.
Keyword:
Ad-hoc network
localization
mobility
range-free
wireless sensor network
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.8K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容