Localization Algorithm For Wireless Sensor Networks Based On Adaptive Path Planning Of Mobile Beacon

Wireless sensor networks(WSNs)are an essential information acquisition and processing technology that finds wide-ranging applications in intelligent transportation and other fields.The positioning technology of WSNs serves as the foundation for enabling target tracking and efficient data transmission.Traditional positioning algorithms typically rely on fixed beacon nodes.However,in scenarios where the network topology is non-uniform and obstacles exist in the deployment environment,a limited number of fixed beacon nodes may not be able to provide adequate coverage for all monitoring areas.Therefore,it is important to have a research on the localization algorithms for WSNs with mobile beacons.In order to improve the positioning performance for the non-uniform network which is deployed in the obstacle environment,in this thesis,we have a research on the WSNs positioning method based on adaptive path planning of mobile beacon.The algorithm can improve the positioning accuracy and positioning coverage of the network by optimizing the mobile path of the beacon node.The main work includes:(1)For non-uniform network distribution,the thesis proposes a network localization algorithm based on mobile beacon optimal dynamic path planning.By using the combination of global planning and local planning,the algorithm avoids the mobile beacon path planning from falling into the local optimal state when the network distribution is non-uniform,and thus obtains the globally optimal mobile beacon path.Simulation experiments show that the algorithm can obtain a better beacon trajectory when the network distribution is non-uniform,and can effectively improve the positioning performance of WSNs.(2)For networks that are deployed in the environment with obstacles,the thesis proposes a non-uniform network positioning algorithm under the path planning and obstacle avoidance of mobile beacons.The main purpose of this algorithm is to avoid moving beacons towards network holes.Firstly,the algorithm adopts the clustering algorithm of network topology density,and clusters the unknown nodes by using the non-uniform information of network topology.Then,we use a combination of global and local planning methods to design the optimal dynamic path of mobile beacons to improve positioning performance.This algorithm can be used for non-uniform networks effectively and has high localization performance.(3)For the localization algorithm of WSNs.,this thesis implements an improved DV-Hop positioning algorithm based on sparrow search by analyzing the main error sources of the classic DV-Hop algorithm in the process of positioning.The algorithm first refines the hops between nodes by using multiple communication radiuses,so that the hops information can be reflect the network topology more accurately.Secondly,the average hop distances between beacon nodes and unknown nodes can be respectively corrected.Finally,the improved sparrow search algorithm is used to obtain the location coordinates of the network nodes.The results of the simulation experiment demonstrate that the algorithm can effectively improve the localization accuracy of nodes in WSNs.