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

Wireless sensor networks are used in A large number of areas,such as object trackingthe aspects of Medical,Smart homeI,ntelligent transportation and so on.In the wireless sensor network system,Obtaining the specific position coordinates of the point at which the sensor carries information in the network is the most critical,and it is the basic link of wireless sensor networks in these applied areas.The wireless sensor network is composed of a number of tiny sensors carrying information points,These points send the collected messages to the terminal monitoring system.To achieve by the people to track the world.Depending on whether it is dependent on the distance measurement,The positioning module is usually divided into two types: Based on the positioning of the distance and the positioning without the need for distance.The DV-Hop positioning module is an important representative of the module that does not depend on the distance measurement.It is located in a simple way,Positioning error is relatively low,Energy consumption is small and so on.But the disadvantage of this module is to use the jump to estimate the distance instead of the real measurement distance.In the random deployment of wireless sensor coverage in terms of accuracy is relatively low.This article on the basis of past scholars to improve and improve,The main contents are as follows:(1)This paper expatiates on the localization method of the classical DV-Hop module and the causes and disadvantages of the exposure of the module,Mainly included: Hops,Average jump distance,Positioning calculation method.Simulation of a lot of DV-Hop improved modules,Simulation results show: The original improvement module shows innovation is relatively simple,Positioning problems are not enough refinement and other issues,which led to positioning accuracy is not high.(2)Improved DV-Hop algorithm.A high accuracy DV-Hop improved localization algorithm is proposed.Improve the algorithm from three places.The first is in the network randomly distributed with multiple communication radius of the anchor node and only one communication radius of the unknown node.When the positioning start,the anchor nodes broadcast information to the network multiple times with different communication radii,the corresponding hops value selects different increments depending on the size of the communication radius.It is to improve the general multi-communication radius DV-Hop.The second method is based on the first improved algorithm,the formula for improving the average distance of each hop.The third method is to weight the corrected value of the unknown node,and the previous two methods are based,to further optimize the algorithm,Thereby reducing the positioning error.(3)Further improve the DV-Hop module.An improved algorithm based on the best hopvalue DV-Hop is proposed.Based on the double communication radius location algorithm,the formula for calculating the average hop distance of anchor nodes is improved by using the concept of hop value transformation,and with the weighted average per hop distance.MATALB simulation shows that the proposed algorithm can improve the positioning accuracy based on the double communication radius algorithm of the DV-Hop algorithm.Finally,Matlab simulation proved,Under a certain condition,a series of improved methods proposed in this paper are compared with other literature algorithms,Can improve the positioning accuracy of nodes.While not increasing the cost of hardware,the amount of Calculate,Node flooding times,energy consumption and so on.