科研之友
微信
新浪微博
Facebook
分享链接
摘要
In ad hoc wireless networks, devices that normally cannot directly communicate route their messages through intermediate nodes. The number of those nodes is called hop count, a useful metric in estimating the distance between 2 nodes. Current methods usually depend on special nodes, called anchors, that need accurate localization information, in order to calculate an estimate for the average distance traversed per hop. The drawback of this approach is that anchor nodes increase the overall cost and complexity of the system. To address this problem, this letter proposes a novel, anchor node-free algorithm that can achieve a useful estimate for actual distance between 2 nodes, by analytically finding an estimate for the average maximum distance traveled per hop and multiplying with the hop count. The only requirement is the a priori knowledge of the networks' node density and the node range. The performance of our method is compared with a recent anchor node-based method and is shown to yield similar location estimation accuracy, despite the fact that it does not use anchor nodes.
- 出版日期2018-9-10
