Analysis of Improved Particle Swarm Algorithm in Wireless Sensor Network Localization

Abstract

WSN localization occupies an important position in the practical application of WSN. To complete WSN localization efficiently and accurately, the article constructs the objective function based on the target node location constraints and maximum likelihood function. It avoids premature convergence through the PSO algorithm based on chaos search and backward learning. Based on linear fitting, the node-flipping fuzzy detection method is proposed to perform the judgment of node flipping fuzzy phenomenon. And the detection method is combined with the localization algorithm, and the final WSN localization algorithm is obtained after multi-threshold processing. After analysis, it is found that compared with other PSO algorithms, the MTLFPSO algorithm used in the paper has better performance with the highest accuracy of 83.1%. Different threshold values will affect the favorable and error detection rates of different WSNs. For type 1 WSNs, the positive detection rate of the 3-node network is the highest under the same threshold value, followed by the 4-node network; when the threshold value is 7.5 (3 ), the positive detection rate of the 3-node network is 97.8%. Different numbers of anchor nodes and communication radius will have specific effects on the number of definable nodes and relative localization error, in which the lowest relative localization error of the MTLFPSO algorithm is 3.4% under different numbers of anchor nodes; the lowest relative localization error of MTLFPSO algorithm is 2.5% under different communication radius. The article adopts the method to achieve accurate and efficient localization of WSNs.

Keywords

• improved partical swarm algorithm
• WSN
• backward learning
• chaotic search
• linear fitting