An Enhanced DV-Hop Localization Algorithm Based on Variable Scene Applications in the IoT

The distance vector hop algorithm is commonly used for sensor node localization. However, its high localization accuracy error and stability issues make it unsuitable for many applications. To overcome these concerns, this article proposes a new function and binary distance vector hop (FBDV-Hop) algorithm with binary controllers and function correction methods while considering the application requirement. In FBDV-Hop, binary controllers are designed to analyze the optimization effect of the module fully and make it adaptable to diverse scenarios. The correction strategies were based on average hop distance measurement, estimated distance, equation composition method, and localization after supplementary correction, which were divided into four modules in accordance with the module error sources of different design correction functions. The simulation experiment was designed to analyze the principle of the role of each module in depth and achieve the optimal optimization effect. The experimental results show that the localization error optimization rate under the FBDV-Hop algorithm was more than 70%, and the optimization rate, stability, effectiveness, and adaptability of the algorithm were considerably greater than the baseline algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Industrial Informatics
Published
2025-04-04
DOI
https://doi.org/10.1109/tii.2025.3552720
Citations
1
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
1.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Enhanced DV-Hop Localization Algorithm Based on Variable Scene Applications in the IoT

Han Shen, Jemal Abawajy, Zhou Zhou, Zhenli He
1 citations
IEEE Transactions on Industrial Informatics
Advanced Algorithms and Applications
1.21
article

An Enhanced DV-Hop Localization Algorithm Based on Variable Scene Applications in the IoT

Han Shen, Jemal Abawajy, Zhou Zhou, Zhenli He
article en
1 citations

Abstract

The distance vector hop algorithm is commonly used for sensor node localization. However, its high localization accuracy error and stability issues make it unsuitable for many applications. To overcome these concerns, this article proposes a new function and binary distance vector hop (FBDV-Hop) algorithm with binary controllers and function correction methods while considering the application requirement. In FBDV-Hop, binary controllers are designed to analyze the optimization effect of the module fully and make it adaptable to diverse scenarios. The correction strategies were based on average hop distance measurement, estimated distance, equation composition method, and localization after supplementary correction, which were divided into four modules in accordance with the module error sources of different design correction functions. The simulation experiment was designed to analyze the principle of the role of each module in depth and achieve the optimal optimization effect. The experimental results show that the localization error optimization rate under the FBDV-Hop algorithm was more than 70%, and the optimization rate, stability, effectiveness, and adaptability of the algorithm were considerably greater than the baseline algorithms.

IEEE Transactions on Industrial InformaticsVol. 21(7)
Deakin University (AU), Yunnan University (CN), Changsha University (CN), Xi'an Technological University (CN)
Natural Science Foundation of Hunan Province
Openalex Percentile: Top 23%
Advanced Algorithms and Applications
1.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.