Analysis of improved particle swarm algorithm in wireless sensor network localization

Among the various WSN technologies, node localization technology is one of the core parts of WSN applications and an important component and key technology, which is also a hot spot and focus of research at this stage. In this paper, firstly, we propose a classical ion swarm localization algorithm for wireless sensor network localization, randomly assigning appropriate velocity and position to each particle in the population in order to find the global optimum in the iterative process. Based on this, a network node localization model is established to convert the functional optimization problem with constraints into an unconstrained optimization problem to solve. At the same time, the space is searched using a chaotic search strategy, which greatly improves the search efficiency. Next, the particle swarm algorithm is further optimized, and simulation experiments are set up using MATLAB software to do comparison experiments on the PSOAPF algorithm and other algorithms. The experimental results show that when the density of beacon nodes is 40%, the average localization error of the PSOAPF algorithm is 14.26%, with the smoothest decreasing trend. When the percentage of anchor nodes is 10%, the localization error is reduced by 6.89%, and the localization accuracy of the PSOAPF algorithm is also higher than other models. This study shows that the improved particle swarm algorithm can effectively improve the localization accuracy, reduce error and accelerate the convergence speed in wireless sensing network localization. © 2023 Daming Yuan, published by Sciendo.