Abstract
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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call