Three-Dimensional Localization Algorithm Based On Improved A* And Dv-Hop Algorithms In Wireless Sensor Network

SENSORS(2021)

Cited 27|Views14
No score
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 disadvantages 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.
More
Translated text
Key words
wireless sensor networks (WSNs), Internet of Things (IoT), 3DDV-Hop, A* algorithm, NSGA-II, hop-count value, average distance per hop
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined