Self network organized and distance concerned multi-routing method for complete route information

Abstract

The method includes following steps: when node A (source node) and node B(destination node) needs to build up route, they send out a route-requested data package (RREQ)001 containing B message to the neighboring intermediate network node by using broadcast form; through retransmission of intermediate network node, more than one route-requested data package will arrive B 002; after B receives a route-requested data package, it responses a data package containing the address of B that is packetized and retransmitted to A 003 through intermediate network node; A reads out the whole route message from returned data package and sends the route message to B; multi whole routes are built up between the A and B.

Description

Technical field: [0001] The invention relates to a wireless data communication network, in particular to an ad hoc network on-demand distance vector multi-routing method with complete routing information. Background technique: [0002] The existing Ad hoc On-Demand Vector (AODV) routing protocol can dynamically and automatically establish a hop-by-hop route between nodes in a mobile wireless network. In this protocol, when the source node needs to establish a route with a destination node with unknown routing information, the source node broadcasts a RREQ to query the route to the destination node. Each node that receives the RREQ first establishes a reverse route to the source node; then queries the local routing table, and if it finds a route to the destination node, it will send a reverse route to the source node according to the previously established reverse routing table. RREP information; otherwise, continue to broadcast the RREQ information. The original AODV routi...

AI Technical Summary

Problems solved by technology

The original AODV routing protocol only establishes and maintains a route between the source node and the destination node. When the route is damaged and cannot be repaired, it will have to search for the route again, which will cause a large delay and delay jitter. Suitable for wireless multimedia applications

In addition, in the original AODV routing protocol, each node does not know the complete routing information, but only knows the next hop node to the destination node, so it is not conducive to provide necessary and sufficient information for upper layer application services

There is also a static routing method. Each network node knows the routing information of all network nodes within one hop, which can ensure that no routing search is performed during communication (but not necessarily the best route), but the topology of the network needs to rely on Additional signaling overhead to maintain, when the network structure changes drastically or the scale increases, a large amount of link capacity is used to maintain the routing information of the system, rather than the transmission of effective information

Therefore, the disadvantages of the above two methods are: the static method uses N 2 For each data packet, only one of the routes is used, and all adjacent node routes must be maintained at intervals. The routing information is incomplete, resulting in excessive overhead, low channel utilization, and long time to re-establish routes (refresh time + refresh interval); traditional The dynamic method uses N data packets to establish a route, only maintains the route of adjacent nodes, cannot be selected, the delay time is long, and the information transmission cannot be guaranteed to be carried out according to a reliable route.

Images