Opportunistic routing algorithm of Ad hoc network based on node priority levels

Abstract

The invention provides an opportunistic routing algorithm of an Ad hoc network based on node priority levels. In the algorithm, an intermediate node transferring list from a source node to a destination node is established by a routing request message and a routing response message; the nodes in the transferring list undergo priority level setting according to the distances away from the destination node which are indicated in the response message; the shorter the distance is, the higher the priority level is; the transferring list is carried at the head part of each data packet; all intermediate nodes in the transferring list have the opportunity to transfer the received data packets; broadcast storm is avoided by setting serial numbers for the data packets; repeated transference of a certain number of data packets can be avoided by comparing the priority levels; and the success rate of information transmission is improved by a transferring node of more than one next hop node. An opportunistic routing mechanism can perform transference by fully utilizing the transferring node which is closer to the destination node in a scene with poorer channel quality, and can ensure higher mailing rate and shorter terminal-to-terminal time delay.

Description

Technical field [0001] The invention relates to a routing mechanism of a wireless multi-hop self-organizing network, in particular to the realization of an opportunistic routing algorithm based on node priority. Background technique [0002] At present, typical routing protocols appearing in Ad hoc networks include DSR, AODV, OLSR, etc. The implementation mechanism of traditional routing is to select the best path between the source and sink nodes, and then forward data packets in sequence along the selected path. When the link condition is relatively good, the traditional routing mechanism can work well. However, the instability of the wireless channel often causes the instantaneous change of the node's transmission range, and the movement of the node or the switch of the machine will also cause the next hop node to be unreachable, which will lead to frequent MAC layer confirmation and retransmission. This in turn causes the routing maintenance process or the routing update proc...

AI Technical Summary

Problems solved by technology

However, the instability of the wireless channel often leads to instantaneous changes in the transmission range of the node, and the movement or power-on / off of the node will also cause the next-hop node to be unreachable, which will lead to frequent confirmation and retransmission of the MAC layer. In turn, it will cause the route maintenance process or route update process at the routing layer. This phenomenon is more serious when the quality of the wireless channel deteriorates or the mutual distance between nodes is just in the critical coverage range.

The unreliability and instability of this link will lead to a large route maintenance cost, and will also cause a large delay or a large number of packet loss in the upper layer business.

Images