Node Localization Algorithm Based On DV-Hop In Wireless Sensor Networks

As a new technology for acquiring and processing information,Wireless Sensor Network(WSN)has the advantages of low-cost,large-scale,dense distributed deployment,and self-configuration.The main function is to help people monitor and control the physical world.It is widely used in many fields such as environmental monitoring,emergency rescue and battlefield monitoring.In wireless sensor networks,it is very important to combine sensor data with location information.In addition,node location information is also very favorable for network coverage quality and routing efficiency.In general,there is no node location information,and monitoring data is meaningless.According to whether the positioning technology needs to obtain information between nodes by means of additional hardware conditions,we usually divide the positioning technology into the following two types: positioning based on ranging and positioning based on no ranging.Based on the positioning mechanism without distance measurement,since it is not necessary to measure the actual distance or angle,it is possible to take less consideration of environmental factors when acquiring the position of an unknown node.Its accuracy can meet the needs of most wireless sensor network applications,while greatly reducing the node hardware requirements and costs.As a typical no-ranging location algorithm,DV-Hop(Distance Vector-Hop)algorithm has no additional requirements on wireless sensor network nodes,and has the advantages of simple implementation,low cost,and low power consumption.In order to further improve the positioning accuracy of the DV-Hop algorithm,I propose several improvements in this paper and use Matlab to simulate and analyze the results.The study is as follows:(1)Using the double communication radius method on the basis of the traditional single communication radius,and then improving the formula for finding the average distance of each hop,putting forward the concept of the best index value,using the minimum mean square error criterion,correcting the average distance formula for each hop,It was found that the best index value exists,making the DV-Hop algorithm the highest positioning accuracy.(2)In the correction value selection stage of the unknown node,the distance of each hop is weighted,and the distance between the anchor node and the unknown node affects the correction value of the unknown node,so that the finally obtained unknown node coordinates are closer to the true value..(3)It proposes the weighted double-communication DV-Hop algorithm with the best exponent combined with a uniform distribution of anchor nodes,simulation verification and comparison with other positioning algorithms and concludes that the positioning results reach the highest position in this paper.Accuracy greatly reduces positioning errors.Matlab simulation results show that under certain conditions,the improved algorithm of this paper is compared with other literature algorithms.It can improve the positioning performance of DV-Hop positioning algorithm without increasing network overhead and hardware.