.png){kind=icon}
.png){kind=icon}
Return
NL-MHP: Efficient and robust network localization algorithm in complex scenarios using maximum hop progress
.png){kind=icon}
PRE
AI
DOI：10.1016/j.adhoc.2025.104110.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Accurate node localization is critical for wireless network applications, yet existing algorithms struggle with low communication efficiency, inaccurate distance measurement, and unstable localization in irregular multi-hop networks. To address these challenges, this paper proposes an Efficient and Robust Network Localization algorithm using Maximum Hop Progress (NL-MHP). NL-MHP integrates routing exploration and distance estimation into a single phase, significantly reducing communication overhead. It further introduces an adaptive hop count threshold to filter out erroneous distances and constructs constrained subregions for each unlocated node to ensure localization stability. The Coati optimization algorithm with Sobol sequence is then employed within these subregions to determine the optimal node location. Comprehensive simulations demonstrate that NL-MHP outperforms existing methods in efficiency, accuracy, and stability for irregular networks. Quantitatively, it improves distance estimation accuracy by 26.7% to 34.8% and localization accuracy by 31.4% to 51.7% compared to three state-of-the-art algorithms.
Journal
IF:
4.8
Papers:
487
Citations:
6.2K