| 摘 要: 现有的定位算法多假设节点均匀分布在规则网络中,节点间的最短路径近似直线。然而,实际场景复杂,最短路径往往偏离直线,造成定位性能下降。对此,提出了一种多跳定位算法。该算法在距离测量阶段通过寻找可靠信标,找到近似直线的路径,保证了距离测量精度;在位置估计阶段采用改进的河马优化算法,结合精确的测量距离迅速地搜索出节点最优估计位置。实验表明,该算法在复杂场景下较同类算法的距离和位置精度分别提升至少17.61%和26.92%,展现出卓越的鲁棒性和适用性。 |
| 关键词: 多跳定位 物联网 可靠信标 河马优化算法 |
|
中图分类号:
文献标识码: A
|
| 基金项目: 国家自然科学基金项目(62302199) |
|
| Multi-hop Localization Algorithm for Complex Scenarios |
|
WANG Wei, YAN Xiaoyong
|
(School of Modern Posts, Nanjing University of Posts and Telecommunications, Nanjing 210003, China)
1222097717@njupt.edu.cn; xiaoyong_yan@126.com
|
| Abstract: Existing localization algorithms often assume that nodes are uniformly distributed in regular networks,where the shortest path between nodes approximates a straight line. However, in rea-l world complex scenarios, the shortest path frequently deviates from a straight line, leading to degraded localization performance. To address this issue, this paper proposes a mult-i hop localization algorithm. During the distance measurement phase, the algorithm identifies reliable beacons to find paths that approximate straight lines, ensuring measurement accuracy. In the position estimation phase, an improved Hippopotamus Optimization Algorithm (HOA) is employed to rapidly search for the optimal estimated node position using precise measured distances. Experimental results demonstrate that, compared to similar algorithms, the proposed method improves distance and position accuracy by at least 17.61% and 26.92% , respectively, in complex scenarios, exhibiting outstanding robustness and applicability. |
| Keywords: multi-hop localization IoT reliable beacon hippopotamus optimization algorithm |
