MATEC Web Conf.
Volume 336, 20212020 2nd International Conference on Computer Science Communication and Network Security (CSCNS2020)
|Number of page(s)||7|
|Section||Intelligence Algorithms and Application|
|Published online||15 February 2021|
Improved recursive DV-Hop localization algorithm for average hop distance optimization
1 College of Information Engineering, Jiangxi University of Science and Technology, Ganzhou 341000, Jiangxi China
* Corresponding author: email@example.com
Aiming at the problem of DV-HOP algorithm with error and energy exhaustion, the average hop distance is used for optimization, and an improved recursion method is used to solve it. The algorithm first squares the distance of anchor nodes, proposes a forgetting factor to optimize the average hop distance between anchor nodes, and secondly uses recursive operations to replace anchor nodes with insufficient energy, so that the localization process of unknown nodes can continue. Experimental results show that compared with the DV-Hop algorithm and the algorithms in related literature, the improved algorithm can reduce the localization error to a certain extent and improve the localization accuracy of unknown nodes.
© The Authors, published by EDP Sciences, 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.