Improved recursive DV-Hop localization algorithm for average hop distance optimization

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 dist...

Full description

Bibliographic Details
Main Authors: Ren Keqiang, Wang Panpan
Format: Article
Language:English
Published: EDP Sciences 2021-01-01
Series:MATEC Web of Conferences
Online Access:https://www.matec-conferences.org/articles/matecconf/pdf/2021/05/matecconf_cscns20_07014.pdf
id doaj-85c8f1a450154de3b28051db0573ee81
record_format Article
spelling doaj-85c8f1a450154de3b28051db0573ee812021-02-18T10:45:31ZengEDP SciencesMATEC Web of Conferences2261-236X2021-01-013360701410.1051/matecconf/202133607014matecconf_cscns20_07014Improved recursive DV-Hop localization algorithm for average hop distance optimizationRen KeqiangWang PanpanAiming 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.https://www.matec-conferences.org/articles/matecconf/pdf/2021/05/matecconf_cscns20_07014.pdf
collection DOAJ
language English
format Article
sources DOAJ
author Ren Keqiang
Wang Panpan
spellingShingle Ren Keqiang
Wang Panpan
Improved recursive DV-Hop localization algorithm for average hop distance optimization
MATEC Web of Conferences
author_facet Ren Keqiang
Wang Panpan
author_sort Ren Keqiang
title Improved recursive DV-Hop localization algorithm for average hop distance optimization
title_short Improved recursive DV-Hop localization algorithm for average hop distance optimization
title_full Improved recursive DV-Hop localization algorithm for average hop distance optimization
title_fullStr Improved recursive DV-Hop localization algorithm for average hop distance optimization
title_full_unstemmed Improved recursive DV-Hop localization algorithm for average hop distance optimization
title_sort improved recursive dv-hop localization algorithm for average hop distance optimization
publisher EDP Sciences
series MATEC Web of Conferences
issn 2261-236X
publishDate 2021-01-01
description 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.
url https://www.matec-conferences.org/articles/matecconf/pdf/2021/05/matecconf_cscns20_07014.pdf
work_keys_str_mv AT renkeqiang improvedrecursivedvhoplocalizationalgorithmforaveragehopdistanceoptimization
AT wangpanpan improvedrecursivedvhoplocalizationalgorithmforaveragehopdistanceoptimization
_version_ 1724263110132367360