Research On Wireless Sensor Network Positioning Algorithm Based On Improved DV-Hop

Wireless sensor networks have very broad application prospects in many fields,among which node localization technology is one of the key technologies of WSN.WSN consists of exclusive,spatially dispersed devices that use sensors to detect certain physical phenomena.Node localization is an important part of many WSN functions and applications,and it is a response to the node location in the system.In order to accurately locate nodes in a wireless sensor network,there are usually two positioning methods used to calculate the position,namely a positioning method based on ranging and a positioning method based on no ranging.DV-Hop algorithm is a key algorithm based on ranging-free node positioning technology due to its robustness,easy implementation and cost-effectiveness.This paper mainly studies the DV-Hop algorithm and improves the disadvantages of the DV-Hop algorithm's low positioning accuracy.The main contents are as follows:1.The main positioning technologies of wireless sensor networks are studied,and the low-cost,widely-used DV-Hop algorithm in non-distance positioning algorithms is studied,including its error sources,performance evaluation standards,and existing improvements.2.Aiming at the error of the hop estimation in the DV-Hop positioning algorithm,a Hop Counts Quantization was introduced to modify the hop count and average hop distance.According to different hop counts,different average distances are selected,so that the distance between the unknown node and the anchor node is closer to the actual value,so as to reduce the relative positioning error.The relative positioning errors obtained by using the above two algorithms under different experimental parameters are simulated and analyzed.The simulation data results show that,under a variety of experimental parameters,the relative positioning error obtained by the hop number classification algorithm is smaller than the relative positioning error obtained by the DV-Hop positioning algorithm.Therefore,it shows that this improvement is reasonable and effective,and provides a node positioning A new idea.3.Aiming at the errors in the positioning calculation stage in the DV-Hop positioning algorithm,a DV-Hop algorithm based on an improved artificial bee colony algorithm is proposed.Compared with other intelligent algorithms,the artificial bee colony algorithm has a strong global optimality,and is not easy to fall into a local optimum.However,there is a problem that the algorithm converges slowly during the positioning process.Information,use Max-Min ideas to divide the possible range of unknown nodes once,change the search area of the hired bee to improve the convergence speed,and at the same time in the iteration of optimization,there will be high similarity of food source location,slower location update speed,search The problem of reduced capability is to increase the frequency of disturbances during the location update process and to improve the search capability by introducing a modifiable control parameter MR.Simulation results show that the improved artificial bee colony algorithm has a much smaller calculation volume than the original artificial bee colony algorithm under the same network parameters,and the positioning accuracy is significantly improved.