Analysis And Improved Research On DV-hop Localization Algorithm For Wireless Sensor Networks

Wireless sensor networks are composed of a large number of tiny low-cost sensor nodes, sensor nodes form multi-hop self-organizing network through wireless communication. Wireless sensor networks have been widely used in a vast variety of areas. For most applications, node localization is one of many key issues in wireless sensor networks research. This article further analyze and research on the node localization problem.The nodes in Wireless sensor networks are divided into two categories:beacon nodes and unknown nodes. The beacon nodes know their own coordinate information; the unknown nodes obtain their coordinate information through network connectivity, distance between nodes and other relevant information. Various localization algorithms can be classified according to different criteria. Here, these algorithms are divided into range-based localization algorithms and range-free localization algorithms. At the same time, we analyze them briefly. In a variety of localization algorithms, this paper analyzes the DV-hop localization algorithm, which is a typical range-free algorithm. Range-free algorithms do not directly calculate the distance between nodes, but according to the number of hops between nodes and hop information to estimate the distance between the nodes, then the unknown nodes obtain their coordinate information. The localization algorithm reduces the hardware requirements, but the localization accuracy is not well.When we analyze the DV-hop localization algorithm, we do a lot of simulation experiments. The average localization error or localization accuracy is used as the algorithm evaluation criterion, to analyze the simulation results. During the research, we put forward some improvement ideas:we optimize the jump distance information to improve the algorithm localization accuracy. The improved algorithms are:DV-hop-NMean localization algorithm and DV-hop-NHs localization algorithm. DV-hop-NMean localization algorithm optimize the jump distance by taking the mean of some specific jump distance information. However, DV-hop-NHs localization algorithm taking the weight of two specific jump distance information. Taking into account the reliability, we make a large number of experiments in the same environmental conditions. Compared with the original DV-hop localization algorithm, the DV-hop-NMean localization algorithm and the DV-hop-NHs localization algorithm are better, their localization errors can reach 6.6 meters, reduce more or less than 15 centimeters. To further improve the algorithm, we use the thought of min-max localization algorithm, optimize the original algorithm and the improved algorithms respectively. Experimental results show that the localization accuracy can increase nearly one meter, which prove the effectiveness of the optimization algorithm. Research on wireless sensor networks localization algorithms and applications have referential significance.