Three-Dimensional Node Localization Algorithm Based on Communication Radius Refinement and Improved Particle Swarm Optimization

Title:Three-Dimensional Node Localization Algorithm Based on Communication Radius Refinement and Improved Particle Swarm Optimization

Volume: 15 Issue: 9

Author(s): Songhao Jia, Cai Yang*Haiyu Zhang

Affiliation:

• College of Computer Science and Technology, Nanyang Normal University, Nanyang, China

Keywords: Node positioning, hop distance optimization, intelligent algorithm, improved particle swarm optimization, inertia weight, variation factor, elimination and optimization mechanism.

Abstract:

Background: With the development of the Internet of things, WSN node positioning is particularly important as its core technology. One of the most widely used algorithms, the DV-hop algorithm, has many advantages, such as convenient operation, use of no additional equipment, etc. At the same time, it also has some disadvantages, like large location error and insufficient robustness. Particle swarm optimization algorithm is advantageous in dealing with nonlinear optimization problems. Therefore, the improved particle swarm optimization algorithm is introduced to solve the problem of inaccurate positioning.

Objective: Aiming at the problem of large positioning error in the three-dimensional node localization algorithm, the paper proposes an intelligent node localization algorithm based on hop distance adjustment. The algorithm is used to optimize the hop number of nodes and make the distance calculation more accurate. At the same time, particle swarm optimization is used to intelligently solve the problem of choosing the most valuable node position.

Methods: Firstly, this paper analyzed the errors caused by the 3D DV-hop localization algorithms. Then, a new method of distance estimation and coordinate calculation is provided. At the same time, mutation factors and learning factor based on the particle swarm optimization algorithm are introduced. Then, a three-dimensional node localization algorithm based on ranging error correction and particle swarm optimization algorithm is proposed. Finally, the improved algorithm is simulated and compared with similar algorithms.

The simulation results show that the proposed algorithm has good convergence and improves the positioning accuracy without additional hardware conditions, and effectively solves the problem of inaccurate node positioning.

Results: The proposed algorithm creatively combines the hop number correction and particle swarm optimization algorithm to improve the accuracy of node positioning and robustness. However，the amount of computation is increased.

Conclusion: Overall, it is within acceptable limits. It is worthwhile to improve the performance with a little increase in the amount of computation. The algorithm is worth popularizing.

Cite this article as:

Jia Songhao, Yang Cai*, Zhang Haiyu, Three-Dimensional Node Localization Algorithm Based on Communication Radius Refinement and Improved Particle Swarm Optimization, Recent Advances in Computer Science and Communications 2022; 15 (9) . https://dx.doi.org/10.2174/2666255814666210617142339