DV-hop Localization Algorithm For Wsn Based On Gases Brownian Motion Optimization

Wireless Sensor Network(WSN)has been widely used in various fields due to its low cost and large scale distribution.Node location technology is the core component of WSN,and DVHOP,as a common location algorithm in WSN,has attracted the attention of researchers.In the study of DV-HOP,we find that this algorithm has a large localization error despite of low cost.Therefore,in view of this problem,this paper carries out the following studies,the main work is as follows:(1)A Layer DV-Hop(LDV-Hop)localization algorithm is proposed in this paper to solve the errors in calculating the minimum Hop number and average Hop distance of DV-Hop localization algorithm.Maslow's concept of hierarchy of requirements pyramid is introduced in the calculation of minimum hop number,and the minimum hop number is layered according to requirements.The average jump distance of each layer is weighted by the case of stratification to correct it.According to the average hop distance of the corrected nodes,the distance from the anchor node to the unknown node can be calculated,and the coordinate information of the unknown node can be calculated.(2)For the errors existing in the estimation of unknown node coordinates of LDV-HOP positioning algorithm,A Mixed Parallel Compact Gases Brownian Motion Optimization(MPCGBMO)algorithm is proposed to locate unknown nodes.Analysis of the traditional GBMO algorithm in the running of the algorithm is easy to fall into local optimal,running time is too long and time complexity is high defects.Aiming at the problem that GBMO easily falls into local optimum,a parallel strategy is proposed.In order to solve the problem that the running time of the algorithm is too long,a population updating formula is proposed.At the same time,a compression scheme is introduced to reduce the time complexity of the algorithm.(3)On the basis of LDV-HOP,the MPCGBMO algorithm is introduced into the process of location estimation of unknown nodes,instead of the traditional mathematical method,and the MPCGBMO-LDV-Hop localization algorithm is proposed.Finally,through three groups of simulation experiments under different conditions,the advantages of the proposed method over traditional DV-HOP and LDV-HOP based on other evolutionary algorithms are verified.The simulation results show that the MPCGBMO-LDV-Hop algorithm proposed in this paper has obvious improvement in positioning accuracy.When the communication radius is set to 15 m,20m,25 m,30m,35 m and 40 m,and the total number of nodes and anchor nodes are 200 and 20 respectively,the positioning accuracy of the proposed algorithm is improved by 28.44%,13.3%,15%,14.58%,14.52% and 12.15%,respectively,compared with the traditional DV-Hop.It provides an effective reference scheme for the study of DV-Hop.