Three-dimensional localization algorithm based on improved A* And DV-Hop algorithms in wireless sensor network

45Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

In the traditional wireless sensor networks (WSNs) localization algorithm based on the Internet of Things (IoT), the distance vector hop (DV-Hop) localization algorithm has the disadvan-tages of large deviation and low accuracy in three-dimensional (3D) space. Based on the 3DDV-Hop algorithm and combined with the idea of A* algorithm, this paper proposes a wireless sensor network node location algorithm (MA*-3DDV-Hop) that integrates the improved A* algorithm and the 3DDV-Hop algorithm. In MA*-3DDV-Hop, firstly, the hop-count value of nodes is optimized and the error of average distance per hop is corrected. Then, the multi-objective optimization non dominated sorting genetic algorithm (NSGA-II) is adopted to optimize the coordinates locally. After selection, crossover, mutation, the Pareto optimal solution is obtained, which overcomes the problems of premature convergence and poor convergence of existing algorithms. Moreover, it reduces the error of coordinate calculation and raises the localization accuracy of wireless sensor network nodes. For three different multi-peak random scenes, simulation results show that MA*-3DDV-Hop algorithm has better robustness and higher localization accuracy than the 3DDV-Hop, PSO-3DDV-Hop, GA-3DDV-Hop, and N2-3DDV-Hop.

Cite

CITATION STYLE

APA

Huang, X., Han, D., Cui, M., Lin, G., & Yin, X. (2021). Three-dimensional localization algorithm based on improved A* And DV-Hop algorithms in wireless sensor network. Sensors (Switzerland), 21(2), 1–22. https://doi.org/10.3390/s21020448

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