An Improved DV-HOP Localization Algorithm Based on Simulation Curve Fitting

Abstract

Localization technology is one of the key technologies in Wireless Sensor Network (WSN). The Centroid algorithm, DV-HOP algorithm, APIT algorithm and Amorphous are the classic algorithms which are based on Range-free localization algorithm. This paper is improved on the basis of the DV-HOP and Weighted DV-HOP node localization algorithm, proposed an improved DV-HOP and weighted DV-HOP of WSN localization algorithm based on Simulation Curve Fitting (SCF). The SCF algorithm makes the process more refined during selecting the beacon node and the selected beacon node can be closer to the accurate position.

A New Range-Free Localization Algorithm Based on Amendatory Simulation Curve Fitting in WSN

“…Therefore selected anchors should be filtered in order to find more suitable ones for location estimation. Considering the above issues, Lin's algorithm [10] based on simulation curve fitting improves the method of anchor selection when executing the second broadcast. It is shown as in Figure 1.…”

“…Principles of ASCF. Considering the above analysis, we can select more suitable anchors using Lin's algorithm [10]. But the error of the distance between selected anchor and unknown node is the same as DV-Hop in some cases.…”

“…However, DV-Hop achieves more considerable localization accuracy, so it has become a hot topic in the study of localization techniques in WSN. The improved DV-Hop algorithms include amorphous, coordinate correction theory, weighted DV-Hop, and simulation curve fitting algorithm [10][11][12], and all of these algorithms use the modification of hop distance and average hop size. Using weighted average hop distance and suitable anchors matching a preset curve, Lin's algorithm based on simulation curve fitting [10] can enhance the localization accuracy of sensor nodes in general case.…”