Research And Improvement Of Wireless Sensor Network Location Algorithm Based On DV-Hop

The application prospect of wireless sensor network is very extensive.It has great application value in many fields such as military defense,agriculture,industry,medical treatment,environment and so on.The research direction of many wireless sensor network in wireless sensor network localization algorithm has been a very popular research project,because the node localization technology is indispensable precondition and foundation for many applications in wireless sensor networks,in the practical application such as the position of the node can not be very accurate,so the research work the will become meaningless,so the study on Localization Technology of wireless sensor network node has great significance.All the advantages of DV-Hop algorithm not only has the range free localization algorithm,and compared with other range free localization algorithm it also has wide application characteristics,so the research of DV-Hop positioning algorithm population is very large,the researchers proposed the improved DV-Hop algorithm and each one has his good points.After reading many pioneer scholars on the localization algorithm of wireless sensor network literature,the depth of the principle of DV-Hop positioning algorithm,analyzes the sources of positioning error of DV-Hop positioning algorithm,and puts forward some improvement on the DV-Hop algorithm of my own thinking,the main work of this paper is as follows:1.deep learning and analyzes the positioning principle of DV-Hop positioning algorithm,the improved algorithm through summing up and learning stage with a large number of DV-Hop,the error sources for DV-Hop localization algorithm,factors summarized and generalized the algorithm produces the positioning accuracy,and simulation experiments by MATLAB simulation tools,simulation of the objective reality analysis of network topology DV-Hop localization algorithm,the positioning error map.2.When the unknown node calculates the estimated distance between the beacon node and the beacon node,the unknown node takes the average jump distance from the nearest beacon node as its average jump distance as its average jump distance.The average jump distance of the unknown node is corrected,and an improved algorithm is proposed,that is,the improved algorithm based on the average jump distance of the corrected unknown node is improved,which improves the positioning accuracy of the algorithm.The simulation results of Matlab show that the proposed DV-Hop improved algorithm based on the average distance of unknown nodes can effectively reduce the positioning error and improve the positioning accuracy compared with the classic DV-Hop location algorithm.3.We have studied the existing DV-Hop improvement algorithm,namely the dual communication radius DV-Hop improvement algorithm,and introduced an adaptive factor to calculate the average jump distance in the second stage of the algorithm,and then proposed an adaptive DV-Hop improvement algorithm based on the dual communication radius,that is,the DCAI DV-Hop improvement algorithm.The algorithm improves the original algorithm from two aspects,the minimum hop value between the precise nodes and the average jump distance of the unknown node,so as to improve the location accuracy of the algorithm.The simulation results of Matlab show that the adaptive DV-Hop algorithm based on the dual communication radius proposed in this paper can effectively reduce the positioning error and improve the positioning accuracy and stability compared to the classical DV-Hop location algorithm and the dual communication radius DV-Hop improved algorithm.