An improved dv-hop positioning method based on correction value error weighting

Abstract

The invention discloses an improved DV-Hop (Distance Vector Hop) positioning method based on correction value error weighting. The method comprises the steps that when an unknown node receives correction values of a plurality of anchor nodes, the correction values of the anchor nodes are endowed with different weights from aspects of the size of the errors of the correction values of the anchor nodes and the hops of the unknown node, the obtained average hop distance is a value to the correction value of each anchor node after normalization weighting processing, the estimated distance between the unknown node and each anchor node is obtained by using the product of the average hop distance obtained through correction value weighting and the number of hops, and finally the positioning coordinates of the nodes are obtained through calculation to complete the positioning of all unknown nodes. The improved DV-Hop positioning method based on correction value error weighting has the advantages that the information of the anchor nodes in a network is fully utilized, the actual state of the network is better reflected and the accuracy of the average hop distance is improved.

Description

technical field [0001] The invention relates to an improved DV-Hop positioning method based on correction value error weighting, and belongs to the technical field of wireless sensor networks. Background technique [0002] A wireless sensor network consists of a large number of cheap miniature sensor nodes deployed in the monitoring area. Each node can cooperate with each other to sense and collect information in the monitoring area, and send it to users wirelessly. Because in many practical applications, data without location information is often meaningless, so node location is an indispensable link in many studies of wireless sensor networks. Due to the limited energy of nodes, it is of practical significance to design a positioning algorithm with high positioning accuracy, no need for additional hardware conditions, and a moderate amount of calculation. [0003] According to whether it is necessary to measure the actual distance between nodes, the positioning algorithm...

AI Technical Summary

Problems solved by technology

However, the correction value of each anchor node already has a certain error, so the average distance per hop obtained by the unknown node will be inaccurate due to the accumulation of errors

[0020] These improvements can improve the positioning accuracy of unknown nodes in the DV-Hop algorithm to a certain extent, but there are still some shortcomings. The error of the average hop distance of unknown nodes is still large.

The correction values ​​of all anchor nodes in the whole network are added to the calculation, or averaged, or given different weights according to the hops from the anchor nodes. Although the globality of the network is considered in this way, it is not easy to rely solely on the hops. Ok, correct the average distance per hop of unknown nodes

Images