Study On DV-HOP Localization Algorithm For Wireless Sensor Networks

With the development of wireless sensor network, the application of the wireless sensor network become more and more wider, such as in military affairs, medical treatment, environment-monitor and industrial and agricultural production, etc. The node localization of wireless sensor networks is the basis of many applications of wireless sensor networks, of which location accuracy is one of critical index. The data information measured by the sensor node is closely related to position information. Currently, node localization algorithms are still in the stage of theory although there have been a large number of them proposed. It is a challenging and difficult problem for node localization automatically. Under the consideration of node energy, low cost and volume, it’s focus and difficult to design low power, low cost, low complexity and high location accuracy.This thesis simply introduction research background, status at home and abroad and conclude some based-range location algorithms and range-free location algorithm, at the same time, elaborate performance evaluation criteria for the location algorithms.This article analysis several sensor network node positioning algorithms, focus on traditional DV-Hop algorithms and some problems about them. Based on the analysis of the DV-Hop algorithm, propose a uniform distribution of anchor nodes to optimize the overall scheme of the algorithm. On the other hand, in the traditional DV-Hop algorithm, all hop numbers of nodes in the communication radius count as one, but in the case of nonuniform distribution of the nodes, this approach will bring greater hop distance calculation error. A triple communication radius improvement is presented, making the relationship of the number of hops and the distance between two nodes closer to a linear law, and using a minimizing mean square error criterion to decrase the distance calculation error of hop distance. Combining these two kinds of improve methods, propose a anchor nodes uniformly distributed triple communication radius DV-Hop algorithm, Simulation result shows that this algorithm reduce the positioning error effectively. Compare with traditional DV-Hop algorithm, the relative error were reduced by16%~37%、16%-39%and16%~34%of25m、35m and45m communication radius.