Research And Improvement Of DV-Hop Localization Algorithm Based On Bacterial Foraging Algorithm

Wireless Sensor Network has been widely used in military and civil fields.In its applications,node location technology is an important,basic technology.According to the existing location technology,node location algorithm can be divided into two categories: based on ranging and nonranging.The DV-Hop algorithm without measurement has the characteristics of low cost,small communication volume,simple implementation and so on,which makes it become a positioning algorithm which is studied more in the non-ranging algorithm.This paper focuses on the DV-Hop for research and analysis,the main content is as follows:(1)This paper analyzes construction,technology,application scenarios of WSN,discusses the special terms,basic principles,positioning algorithm and coordinate calculation method of node positioning technology,focuses on analysis of positioning principle of DV-Hop and its errors.(2)In view of the DV-Hop the average error of the hop distance and estimated distance exists,in this paper,using the global average hop distance,local average hop distance correction coefficient and the distance to optimize DV-Hop,unknown nodes when selecting average hop distance without relying on recent beacon node distance themselves,but considering the other beacon nodes,the global and local average hop distance are normalized to optimize the traditional average hop distance,and the calculated beacon node and the estimate of the distance between the unknown node to join distance correction coefficient.Experiments show that the optimized algorithm has better positioning effect compared with the classical algorithm.(3)Bacterial foraging algorithm and Newton's method are introduced to optimize DV-Hop in view of the errors in node coordinate calculation stage.The global searching ability of the bacterial foraging algorithm is relatively good,but its convergence speed is not fast.Based on this,Newton's method is introduced to further optimize the bacterial foraging algorithm.Newton's method has a fast convergence speed,but the selection of its initial value is a problem that needs to be considered.In calculation of node coordinates,the maximum likelihood and other methods are cancelled,and BFO is used to calculate node coordinates,and this result is taken as the initial value of Newton's method to further optimize,so as to get the final result.The simulation results show that the positioning algorithm with intelligent optimization algorithm has better positioning effect.