Optimal path selection algorithm for mobile beacons in sensor network under non-dense distribution

When the traditional anchor aided location algorithm is used to select the mobile beacon path in the sensor network, there is no analysis of the energy imbalance of nodes in non-dense conditions, the optimal network node cannot be selected, and the selection error of the optimal path of the beacon is larger. A path selection algorithm for mobile beacons in a sensor network under non-dense distribution is proposed. Using the mobile beacon based wireless sensor network location algorithm, the weighted centroid algorithm and the extended Kalman filter (EKF) are used to obtain the accurate location results of the unknown nodes around the mobile beacon in the sensor network under non-dense distribution condition. The optimal node energy partition of the unknown node is obtained by the chaotic differential evolution method, and the optimal location of the optimal energy node in the wireless sensor network is calculated using the dynamic escape particle swarm optimization method, and the optimal beacon path is extracted. The experimental results show that the proposed algorithm can enhance the clustering performance of the optimal node in the wireless sensor network and has a better performance of dynamic node selection in wireless sensor network, and the convergence speed is faster and the operation time is shorter.