Based On The Dv - Hop Of Wireless Sensor Network Localization Algorithm Research And Improvement

DV-Hop algorithm is a typical range-free localization algorithm, which can avoid the node directly ranging errors and can also run in the anchor node ratio than hours, because it uses two jump distance between nodes, namely, the nodes of hops and the average hop distance of the product instead of the true distance, positioning calculation, both of which will result in certain errors, affecting the algorithm’s accuracy; besides DV-Hop positioning algorithm is not only used in flooding, communication overhead extensively, but also increases the algorithm energy consumption. In view of the above problems, the passage reviews and researches on related literatures, discussing DV-Hop positioning algorithm of theoretical knowledge, also to the existing improved methods to do the experimental analysis, this paper proposes a new algorithm, at the same time in order to solve the DV-hop algorithm in3D environment localization problem, the essay proposes an improved particle swarm optimization algorithm to the three-dimensional environment of unknown node and anchor nodes between the estimated distance and the actual distance of the mean square error is set to be the optimal objective function, and then an improved DV-Hop algorithm combining is applied to three-dimensional environment, location, in this work are summarized as follows:1, In order to reduce information overlap and implosion, a kind of new flooding protocol improvement in information transmission process is putted forward to remove redundant nodes.algorithm reduces the communication overhead through experimental verification;2, To fix a hop hop distance error, and reduce the communication overhead, the overlapping area of overlap with neighboring nodes to replace according to the adjacent node communication radius within the overlap area and node distance mathematical relationship. seek the distance between nodes; in order to revise the N(N≥2)hop hop distance error, according to the adjacent node jump number distribution ratio and the distance between nodes and the mathematical relationship between, solve the distance between nodes; by three edge of triangle relation on jump range restriction;3, Using of the anchor node to choose the optimal strategy to reduce node calculation quantity and cut dwon errors;4, After locating the unknown node temporarily escalate as anchors and involved in adverse node positioning, positioning and then recovery for unknown nodes, trying to reduce the amount of calculation, without increasing energy consumption situations to deal with bad node as the problem, reducing the overall positioning error: 5. To study of particle swarm optimization algorithm, and its improving, it puts forward the adaptive weighted and the survival of the fittest thoughts into the particle swarm algorithm, improves the convergence speed, which overcomes the defects of easy to fall into local optimum, easier to find the global optimal solution, and combined with the improved DV-Hop the algorithm, which will be applied to the three dimensional environment mapping.