Research On Wireless Sensor Network Positioning Technology Based On Simulated Annealing

In the application of wireless sensor networks,node location technology is one of the most important technologies.According to different location mechanisms,wireless sensor networks can be classified into distance-based(distance-based)positioning algorithms and non-ranging(distance-independent)positioning algorithms.The non-ranging location algorithm has more advantages in terms of cost and power consumption,so the non-ranging location algorithm is the focus of this study.The main contents include:(1)Introduce several typical distance-independent localization algorithms,introduce the mathematical principles involved in the algorithm in detail,briefly analyze the advantages and disadvantages of the algorithm,and finally introduce the innovative app lication of related algorithms.(2)Aiming at the large error of DV-Hop algorithm in estimating the average hop distance and the DV-Hop algorithm which is sensitive to ranging error when using least square method,a weighted location algorithm based on simulated annealing is proposed.The improved algorithm introduces the average error correction value per hop,and performs weighted processing to reduce the hop error.The traditional DV-Hop localization algorithm uses simulated annealing instead of least square to locate the unknown node.Simulation results show that the algorithm effectively reduces the positioning error of DV-Hop algorithm.(3)The DV-Hop algorithm can also be optimized.Based on the existing research,a new localization algorithm is proposed.The improved algorithm broadcasts the data using multi communication radius and refines the hops to reduce the location error.In calculating the average one-hop distance,remove the isolated nodes,introduce weights corrected results,to obtain a more precise one-hop distance.