Routing algorithm for DTN (Delay Tolerant Network)

Abstract

The invention provides an EDHO (Earliest Delivery based on Historical Orderliness) routing algorithm for a DTN (Delay Tolerant Network) and particularly designs a routing algorithm based on knowledge prediction. The algorithm comprises the following four steps of: 1) establishing a historical orderliness prediction knowledge base; 2) calculating the RMs (Reliability Metric) of nodes; 3) calculating route selecting indexes WRM (Weight using RM); and 4) establishing and updating EDHO algorithm routes, wherein the historical orderliness prediction knowledge base is established according to network topological information, the RMs are calculated according to the historical orderliness prediction knowledge base, the route selecting indexes WRM are determined according to RM values, and a route table is established and updated according to the route selecting indexes. An information loss problem caused by high connecting discontinuity in the DTN can be optimized by the algorithm.

Description

technical field [0001] The invention belongs to the technical field of routing in a delay-tolerant and outage-tolerant network (DTN), and in particular relates to a routing algorithm for a delay-tolerant and outage-tolerant network. Optimization, dedicated to increasing the success rate of message transmission and routing reliability. Background technique [0002] In the era of rapid development of information technology, the birth of the network has brought unprecedented changes to human society. In a traditional Internet network, its nodes maintain an end-to-end continuous connection, and the data link has a consistent uplink and downlink channel rate, and maintains a high data rate and low bit error rate during message transmission. The architecture of this type of network It is based on the TCP / IP protocol cluster and is generally applicable to most network applications. However, with the increasing demand for information acquisition, especially the challenging network...

AI Technical Summary

Problems solved by technology

[0017] In the DTN network, the movement between nodes is frequent, and node failures also occur frequently. The transmission of messages takes a certain amount of time. Whether a message can be successfully transmitted between two nodes requires not only the existence of a connection between the two nodes, or The index of small delay also requires that the duration of the connection between the two nodes is long enough, especially when the message size is large, the index of duration is more important, because the transmission time of large messages is longer, in this case, even if the connection The delay is small, but without enough connection duration, the message still cannot be successfully forwarded

Images