An Improved DV-Hop Localization Algorithm for Wireless Sensor Networks

Considering the poor localization accuracy when applying DV-Hop algorithm to node location in wireless sensor networks, an improved DV-Hop localization algorithm for wireless sensor networks, named iDV-Hop, is proposed in this article. In the proposed algorithm, anchor nodes refine their average hop-size by minimum mean square error and modify it by error factor. Then, the average hop-size between the unknown node and the anchor node is modified by a dynamic weight coefficient, which is related to the minimum hop number. Using this average hop-size and the minimum hop number, the distance among each unknown node and all anchor nodes can be calculated. Finally, the coordinates of unknown nodes are estimated by the 2D hyperbolic localization algorithm. To obtain higher localization accuracy, the unknown node upgrades its location by exploiting the obtained information in solving the system of equations. Simulations are carried out on three network models constructed by complex network theory and the analysis of the simulation results will actually help the engineers to deploy the proposed localization algorithm for the real-world wireless sensor network.