Abstract
In wireless sensor networks, accurate node localization is essential for ensuring the precision of data collection. The DV-Hop algorithm, a popular range-free localization method, estimates distances between nodes by multiplying hop counts with average hop distances obtained through distance vector routing. However, this algorithm often experiences localization errors in randomly distributed network environments due to considerable inaccuracies in average hop distance calculations and the approximation of actual paths by straight-line paths. This paper introduces an enhanced DV-Hop localization algorithm, which constructs a mathematical model to optimize the mean square error of the average hop distance for any anchor node. This optimization corrects the average hop distance across the network, bringing it closer to the actual value, thus reducing errors and enhancing accuracy. Simulation results indicate that with 150 nodes, a 30% beacon node ratio and a 100-m communication range, the localization error of the improved FuncDV-Hop model decreased from 0.3916 to 0.1705, and the Root Mean Square Error (RMSE) decreased from 24.78[Formula: see text]m to 14.39[Formula: see text]m, thereby improving localization accuracy by 56.46%.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.