An improved distance vector-Hop localization algorithm based on coordinate correction

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In order to improve the localization accuracy of distance vector-Hop algorithm under the random topology network scenarios, a novel algorithm named coordinates correction-distance vector-Hop is proposed. Coordinates correction-distance vector-Hop defines the pseudo-range error factor to improve the accuracy of average hop distance. In order to improve the localization accuracy, the unknown node uses distances to part of anchor nodes to locate. Furthermore, anchor nodes are treated as unknown when obtaining their coordinate correction values which are used to correct the localization results of unknown nodes. The simulation results show that each step of coordinates correction-distance vector-Hop can increase the localization accuracy effectively; coordinates correction-distance vector-Hop is better than the traditional distance vector-Hop and some existing improved algorithms both in localization accuracy and in localization stability.

Cite

CITATION STYLE

APA

Wang, X., & Nie, Y. (2017). An improved distance vector-Hop localization algorithm based on coordinate correction. International Journal of Distributed Sensor Networks, 13(11). https://doi.org/10.1177/1550147717741836

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free