Improved DV-Hop Localization Algorithm Based on Distance Correction of Anchor Nodes

Wu, Lei; Hou, Zhongwei; Tan, Cheng; Xu, Dengyuan

doi:10.14257/ijfgcn.2016.9.10.23

Cited by 3 publications

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, the improved positioning algorithm is simulated by using MATLAB simulation platform, and compared with the classical improved DV-Hop algorithm in recent two years. Reference [15] is recorded as ORDV-Hop. The performance of the algorithm can be fully demonstrated by simulating and analyzing the simulation environment, topology and node characteristics of wireless sensor networks.…”

Section: Simulation Environment and Evaluation Indicatorsmentioning

confidence: 99%

Improvement of Localization Algorithm for Wireless Sensor Networks Based on DV-Hop

Xin

Fei²,

Ling³

2019

Int. J. Onl. Eng.

View full text Add to dashboard Cite

In order to solve the problem that the DV-Hop localization algorithm has large errors in the wireless sensor network environment, this paper uses the minimum mean square criterion to determine the average hop distance of anchor nodes, and then calculates the mean value of the original average hop distance, which ensures that the improved average hop distance is closer to the real average hop distance of the whole network. The estimated distances between nodes are calculated by using the correction value corresponding to the average jump distance of the anchor node; in the positioning stage, when the anchor node is small, the estimated coordinates of unknown nodes are obtained by the minimum-maximum method; when the number of anchor nodes is large, the coordinates of unknown nodes are calculated by the maximum likelihood estimation method; this not only reduces the amount of calculation, but also the accuracy is more stable. This step is not only suitable for DV-Hop algorithm, but also can be used to estimate the coordinates when the distance between the unknown node and the anchor node is known. However, this improved method is only applicable to the premise that the simulation area is not large, so this improvement has its scope of adaptation, according to the needs of choice. Finally, the unknown node coordinates are iteratively optimized by using the quasi Newton method. Simulation results show that the proposed positioning algorithm has higher accuracy and better stability.

show abstract

Section: Simulation Environment and Evaluation Indicatorsmentioning

confidence: 99%

Improvement of Localization Algorithm for Wireless Sensor Networks Based on DV-Hop

Xin

Fei²,

Ling³

2019

Int. J. Onl. Eng.

View full text Add to dashboard Cite

show abstract

“…The researches on the location methods for wireless sensor network node mainly focus on the location algorithm based on distance measurement and the location algorithm without distance measurement. Among them, the location algorithm based on distance measurement needs additional hardware to support the distance measurement between nodes [7,8]. Compared with the location algorithm based on distance measurement, the location algorithm without distance measurement does not need external hardware, and the cost of network nodes is low.…”

Section: Introductionmentioning

confidence: 99%

Research on DV-Hop improved algorithm based on dual communication radius

Wang

2020

J Wireless Com Network

View full text Add to dashboard Cite

In order to solve the problem that the traditional DV-Hop location algorithm has a large error in locating unknown nodes, this paper proposes an improved DV-Hop algorithm based on dual communication radius. By adding a communication radius, the algorithm updates the minimum hop number obtained by the unknown node closer to the beacon node to a smaller hop value and keeps the minimum hop number information of unknown nodes farther away. This method reflects the gap between the actual distances in terms of hop number, which solves the problem of the large difference between the actual distances of the same hops to a certain extent. Therefore, it is more advantageous to estimate the more accurate average jump distance and can calculate the more precise distance between them and obtain the more precise coordinates of unknown nodes. MATLAB simulation results show that the improved algorithm based on dual communication radius DV-Hop can effectively reduce the location error and improve the location accuracy and stability compared with the traditional DV-Hop location algorithm.

show abstract

Localization and Detection of Targets in Underwater Wireless Sensor Using Distance and Angle Based Algorithms

et al. 2019

View full text Add to dashboard Cite

Improved DV-Hop Localization Algorithm Based on Distance Correction of Anchor Nodes

Abstract: Abstract

Cited by 3 publications

References 2 publications

Improvement of Localization Algorithm for Wireless Sensor Networks Based on DV-Hop

Improvement of Localization Algorithm for Wireless Sensor Networks Based on DV-Hop

Research on DV-Hop improved algorithm based on dual communication radius

Localization and Detection of Targets in Underwater Wireless Sensor Using Distance and Angle Based Algorithms

Contact Info

Product

Resources

About