Research On DV-Hop Localization Algorithm Based On ZigBee Wireless Sensor Network

With the vigorous development of the Internet of Things technology,a variety of Internet of Things devices and technologies have been widely used in various fields.As the information carrier of the Internet of Things technology,wireless sensor network technology has also achieved unprecedented development tide.ZigBee network protocol is an important member of the wireless sensor network technology.Because of its specific advantages,ZigBee network protocol is applied in many fields.As one of the important research topics of the wireless sensor network,the node location technology has very important practical significance in the practical application.In an actual wireless sensor network,the position of the node can indirectly or directly reflect the location of the data generation.Therefore,in most wireless sensor applications,network node location is a basic requirement,but the current network node location technology is generally low in positioning accuracy,and it is difficult to reflect the true location of the node.The DV-Hop positioning algorithm is commonly used in ZigBee networks as a localization algorithm.It is even widely used in the entire wireless sensor network field.However,under the influence of various factors,the positioning effect of the DV-Hop algorithm in practical applications is not very good,positioning accuracy is relatively low,and there is also a problem that is difficult to avoid.The distribution of some nodes in the network is rather special,which results in the DV-Hop algorithm can not calculate the coordinates of these nodes,which also directly reduces the DV-Hop the overall positioning accuracy of the algorithm.In this paper,the DV-Hop localization algorithm is deeply analyzed and explored to find out the reason for the low precision of some DV-Hop algorithms,including the lack of optimization in the selection of the Beacon node group,the large insufficiency of the signal node to the blind node,and the calculation of the blind nodes' jump distance.In view of the above three main deficiencies,This paper optimizes the algorithm for DV-Hop localization,hoping to reduce the location error of the network node and improve the accuracy of the node positioning.Firstly,by introducing the method of the hop-number threshold,we select the Beacon node group which is used for locating the different blind node distribution area.Then the hop number correction coefficient is used to modify the hop number of beacon node to blind node,so as to reduce the influence of the error of hop count on the location accuracy of the node.By dividing the network,the influence of uneven network distribution on the hopping distance of different blind nodes is reduced,and the location accuracy of unknown nodes is improved.Finally,in order to verify the effectiveness of the improved algorithm,the MATLAB simulation experiment platform was used to simulate the optimized DV-Hop algorithm and the original DV-Hop algorithm in the same node environment,and multiple experiments were used to average the results.The value method reduces the influence of chance on the experimental results.Finally,the recorded experimental results are made into a line chart,which can improve the accuracy of the improved node positioning accuracy at a glance.