Skip to Main Content
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
DV-Hop algorithm is one of the important range-free localization algorithms. Three improved methods are put forward in this paper to settle the larger location error of the classic DV-Hop localization algorithm. First, the average hop-size of each anchor node is calculated by adopting least squares method. Second, the distance between unknown nodes and anchor nodes is refined by means of the average hop-size of different anchor nodes. Third, the initial coordinates of unknown nodes are estimated by means of repeated applications of Multilateration Method, then the average of them. Comparing with the classic DV-Hop algorithm, the simulation results show that these improvements can greatly enhance the localization accuracy of unknown nodes at the cost of increasing appropriate computation overhead, in addition, they need no further communication resources and accessional localization devices.