Improvements of DV-Hop localization algorithm for wireless sensor networks

Abstract

© 2015, Springer Science+Business Media New York. Based on the improvements of the original DV-Hop localization algorithm, three new localization algorithms (iDV-Hop1, iDV-Hop2, and Quad DV-Hop) are presented in this article. In iDV-Hop1 and iDV-Hop2, all steps of the original DV-Hop are kept, and several steps based on geometry improvements of the localization problem are added in order to obtain better localization accuracy. The third algorithm (Quad DV-Hop) formulated the localization problem as bounded least squares problem, to be solved by quadratic programming. Simulations are carried out on the four different types of network topology by varying nodes communication range, number of anchor nodes and number of nodes. Comparison of our algorithms with the original DV-Hop and Improved DV-Hop algorithms are given. It is shown that iDV-Hop1 algorithm can significantly reduce the localization error (up to three times) in scenarios with irregular topologies compared to DV-Hop and Improved DV-Hop. In scenarios with regular topologies, iDV-Hop2 and Quad DV-Hop showed better performance compared to DV-Hop and Improved DV-Hop (up to 11 % lower localization error).