Research And Improvement Of Wireless Sensor Network Location Algorithm Based On DV-Hop

With the rapid development of wireless sensor network technology,it is more and nore used in people's life.Wireless sensors can be used in many fields,such as medicine,science,military operations,commercial trade,government applications,weather monitoring and so on.In the research direction of wireless sensor network,its location technology is a very popular research project.The research of wireless sensor network is based on location,so the research of wireless sensor network location technology is of great significance.Wireless sensor positioning algorithm is divided into two types: ranging and range-free.DV-Hop(Distance Vector Hop)positioning algorithm is popular as a range-free positioning algorithm,because it has higher positioning accuracy compared with other range-free positioning algorithms,and it can calculate the coordinates of unknown nodes if it knows the coordinates of three neighbor nodes.After reading a lot of literature related to the localization technology of wireless sensor network nodes,this paper analyzes the principle of the error of DV-Hop positioning algorithm,and proposes the improved method based on DV-Hop positioning algorithm.The main work of this paper is as follows: 1.Deeply analyzed the positioning principle of DV-Hop algorithm,analyzed the error sources of DV-Hop positioning algorithm,summarized the factors leading to the positioning error of the positioning algorithm,and simulated the network topology diagram and positioning error diagram of DV-Hop positioning algorithm.2.DV-Hop algorithm is improved by combining RSSI and particle swarm optimization algorithm.An RSSI ranging technique and a weighted method are introduced to improve the minimum hops between nodes and the average hop-size between unknown nodes,and the error caused by the least square estimation of unknown node coordinates is corrected by particle swarm optimization algorithm.Simulation results show that the improved algorithm has higher positioning accuracy than the classical DV-Hop algorithm.3.In view of the shortcomings of DV-Hop positioning algorithm such as large positioning error and long positioning time,an improved DV-Hop algorithm based on K-means clustering was proposed in combination with the multi-communication radius algorithm.The distance ratio is used to improve the multi-communication radius algorithm,and then the undetermined nodes are clustered by K-means,and then each cluster set is positioned.Simulation results show that the improved DV-Hop algorithm has lower positioning error and faster positioning time.