Routing void processing method for wireless sensor network

Abstract

The invention discloses a routing void processing method for a wireless sensor network. The method is characterized by comprising the following steps: step 1, a finding node (a finding node means a node that cannot find other nodes much nearer to a target node than the finding node) starts a void exploration packet to calibrate a void edge node; step 2, the finding node maps the void edge node to a virtual circle to obtain a virtual coordinate and starts to distribute the packet to various nodes; step 3, the peripheral area of the current node is divided, different strategies are executed in different areas to select the next node, and a void in the wireless sensor network is bypassed. The routing void processing method for the wireless sensor network can enable the data from different directions to bypass the void effectively and is easy to implement.

Description

technical field [0001] The invention belongs to the technical field of wireless sensor network communication, and relates to a method for processing routing holes in a wireless sensor network. Background technique [0002] Geographic location routing is a routing algorithm that only relies on the location information of neighboring nodes for path selection. Because this type of protocol is less affected by the network scale and has good scalability, it has broad application prospects in large-scale wireless sensor networks. [0003] The greedy algorithm mechanism is commonly used in geographic location routing. When a node uses the greedy algorithm, it selects a neighbor node that is closer to the destination node than itself as its next hop. If there is no such node, there will be a local minimum problem, or a routing hole problem. There are two main methods to overcome routing holes. One is to reduce the failure rate of greedy algorithms, such as the algorithm that uses t...

AI Technical Summary

Problems solved by technology

[0004] Although the above-mentioned first type of algorithm can improve the transmission success rate, there are still some nodes that cannot overcome routing holes. If there are key nodes among them, it will have a fatal impact on the integrity and effectiveness of system functions

In addition, due to the need for mechanisms such as flooding and backtracking to complete the reconstruction of location information or the establishment of hole fences, it will result in a large control packet overhead, which is not conducive to network energy saving

Although the second type of method can make the data packet bypass the hole smoothly, it is not conducive to the wireless sensor network because the path length is often large and as the network scale increases, nodes need to spend more resources to maintain the link topology map of the network. The expansion of the recovery mode; and the recovery mode requires more control packet overhead, so frequent entry into the recovery mode when the data packet passes through the hole will lead to an increase in the control overhead

Images