A New Distance Vector-Hop Localization Algorithm Based on Half-Measure Weighted Centroid

24Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Considering the defects of the Distance Vector-Hop (DV-Hop) localization algorithm making errors and having error accumulation in wireless sensor network (WSN), we proposed a new DV-Hop localization algorithm based on half-measure weighted centroid. This algorithm followed the two-dimensional position distribution, designed the minimum communication radius, and formed a reasonable network connectivity firstly. Then, the algorithm corrected the distance between the beacon node and its neighbour node to form a more accurate jump distance so that the shortest path can be optimized. Finally, we theorized the proposed localization algorithm and verified it in simulation experiments, including same communication radius, different communication radii, and different node densities in same communication radius, and have compared the localization error and localization accuracy, respectively, between the proposed algorithm and the DV-Hop localization algorithm. The experiment's result shows that the proposed localization algorithm have reduced the localization's average error and improved the localization's accuracy.

Cite

CITATION STYLE

APA

Jian Yin, L., & Elhoseny, M. (2019). A New Distance Vector-Hop Localization Algorithm Based on Half-Measure Weighted Centroid. Mobile Information Systems, 2019. https://doi.org/10.1155/2019/9892512

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