Reliable opportunistic routing method and device based on area division and virtual destination node

Abstract

The invention discloses a reliable opportunistic routing method and device based on area division and virtual destination node. The method includes the following steps: network area division, virtual destination node location determination, node area level and layer number determination, and forwarding candidate set determination. , select forwarding nodes and information forwarding. This algorithm takes the directionality issue into consideration when selecting the forwarding candidate set. Under complex network structures, compared with the traditional opportunistic routing algorithm that blindly broadcasts in all directions, it greatly improves the transmission success rate; this algorithm reduces transmission delay, It has strong real-time performance and solves the problem that traditional geographical location routing is easy to choose the wrong direction in complex areas.

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) only by comparing the Euclidean distance between each neighbor node and the destination node to select the strategy of the next hop 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 defects: 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