Reliable opportunity routing method and device based on regional division and virtual target node

Abstract

The invention discloses a reliable opportunity routing method and a reliable opportunity routing device based on regional division and virtual target node. The method comprises the steps of dividing a network region; determining the position of a virtual target node; judging the node region level and level number; determining a forwarding candidate set; selecting the forwarding node and forwarding information. According to the method, the problem of direction is considered when the forwarding candidate set is selected, and compared with a traditional opportunity routing algorithm of blind omnibearing broadcasting, the transmission success rate can be greatly improved under a complicated network structure; the method can be used for reducing transmission delay, is strong in real time performance, and solves the problem that the direction is easily selected incorrectly in a complicated region by using a traditional geographic position routing.

Description

technical field [0001] The invention relates to the technical field of wireless networks, in particular to a routing method for a wireless sensor network based on network hierarchy division and transmission direction, and the method is applicable to wireless sensor networks for monitoring large-scale banded areas such as the Great Wall. Background technique [0002] Data collection is the primary task in environmental monitoring applications. Sensing nodes need to reliably transmit the collected information to the destination node, which affects the node quality, network life cycle, transmission delay, communication cost, transmission success rate, etc. aspect request. Since routing policies have a crucial impact on these properties, an efficient routing mechanism is a key issue. [0003] The Great Wall, which has a history of more than 2,000 years, is facing the situation of disappearing. It is urgent to protect the Great Wall. The Great Wall belongs to linear cultural h...

AI Technical Summary

Problems solved by technology

[0005] The second type: routing based on geographical location; the defects of this routing method are: 1) The strategy of selecting the next hop node only by comparing the Euclidean distance between each neighbor node and the destination node, in some more complex does not apply in the region

For example, in the strip area with many corners, such as figure 2 As shown, due to the blind selection of nodes closer to the destination node, this method cannot effectively reduce the number of hops, but it is easy to cause errors in the selection of the propagation direction, and eventually lead to packet loss

2) Each node only selects an optimal next-hop node, which can easily lead to packet loss

[0008] Same as traditional opportunistic routing and routing algorithms based on geographic location, this method has the following disadvantages: 1) The strategy of selecting the next hop node only by comparing the Euclidean distance between each neighbor node and the destination node, in some more complex does not apply in the region of

For example, in the strip area with many corners, such as figure 2 As shown, due to the blind selection of nodes closer to the destination node, this method cannot effectively reduce the number of hops, but it is easy to cause errors in the selection of the propagation direction, and eventually lead to packet loss

2) When a node selects a forwarding node, all its neighbor nodes need to coordinate and select an optimal (that is, the closest to the destination node) node as a forwarding node through a large number of data packet exchanges, which increases the communication overhead

Images