DV-Hop Improved Localization Algorithm Based On Wireless Sensor Networks

Location information is one of the key elements of monitoring data in wireless sensor networks.As a classical rang-free localization algorithm,distance vector-hop localization algorithm is widely used with its unique advantages,but its localization accuracy is not high,and it is of great theoretical and practical significance to improve its localization performance.From the mathematical principles,this dissertation analyzes in detail the problems of three unknown node localization calculation methods in practical situations,and analyzes the factors affecting the localization error and the error sources of the three stages of DV-Hop algorithm.The corresponding improvements are made for the three phases of the DV-Hop algorithm,and DV-Hop algorithm based on cyclotomic method together with weighted normalization,also known as CMWN-DV-Hop,is nominated.In the first stage,based on cyclotomic method,the segmentation factor a is introduced to refine the number of hops.In the second stage,the weighting model is constructed,weighting factors β_λ are introduced,and the average hop distance is optimized.In the third stage,the weighted least squares recursive algorithm(WRLS)is used to calculate the unknown node coordinates.The simulation test and analysis evaluation of the localization performance of CMWN-DV-Hop algorithm show that the average localization error of the proposed algorithm is significantly reduced compared with the other four localization algorithms.Moreover,the average localization error of CMWN-DV-Hop algorithm decreases when the segmentation factor increases,and the CMWN-DV-Hop(a=10)algorithm has the best localization accuracy.The comprehensive analysis shows that the CMWN-DV-Hop algorithm has low sensitivity to the number of nodes,anchor node ratio and communication radius,and has shorter elapsed time and less energy consumption,which can be adapted to large-scale deployment of wireless sensor networks.