DV-Hop algorithm based on node communication radius and beacon node distribution

Abstract

The invention discloses an improved DV-Hop algorithm based on optimum node communication radius. The algorithm comprises the steps of: determining a beacon node optimized distribution mode and optimum node communication radius through the actual parameters of a monitored area; then obtaining minimum hops from all nodes to a beacon node in a network, wherein the beacon node uses a least square method to calculate average hop distance according to the positions of other beacon nodes and minimum hops in distance and broadcasts the average hop distance to the network; when an unknown node receives a correction value for the first time, calculating the distance from the unknown node to the beacon node; and finally calculating the coordinates of the unknown node. Before nodes are deployed, according to the actual situation of the monitored area, the beacon node optimized distribution mode is obtained through error analysis; by using the node distribution characteristic of a wireless sensor network to obtain the optimum node communication radius, the communication overhead is not increased; and by using the least square method to obtain the average hop distance of the beacon node and conducting weighting processing to optimize the position of the unknown node, the positioning performance of the nodes in a random network is effectively improved.

Description

technical field [0001] The invention relates to the fields of wireless communication and information dissemination, in particular to a wireless sensor network non-ranging positioning algorithm DV-Hop. Background technique [0002] Positioning technology is one of the key technologies of wireless sensor network (WSN). According to whether the distance between actual nodes needs to be measured during the positioning process, positioning algorithms can be divided into ranging-based positioning algorithms and non-ranging positioning algorithms. The non-ranging positioning scheme has the advantages of less energy consumption, low hardware cost, strong ability to resist measurement noise, and high positioning accuracy, and has attracted attention and been widely used. [0003] The DV-Hop positioning algorithm is based on the idea of ​​distance vector routing, and uses the product of the average hop distance and the number of hops between two nodes to represent the distance betwee...

AI Technical Summary

Problems solved by technology

However, the first three methods require unknown nodes to store the average hop distance value of all beacon nodes, and additional local network information and beacon nodes need to continuously use multiple transmission radii. These three methods greatly increase the storage, communication and Computational overhead

At the same time, the first two methods do not consider the impact of the distribution of beacon nodes on positioning performance; the third method does not consider the impact of the average jump distance error on positioning performance; the fourth method uses ranging technology and mobile beacons Node increases hardware cost and positioning delay

Images