Adaptive DTN (Delay Tolerant Network) routing algorithm based on resource-constrained condition

Abstract

The invention provides an adaptive DTN (Delay Tolerant Network) routing algorithm based on a resource-constrained condition. That is, an applicable routing algorithm is selected according to the current load of a node based on an adaptive routing algorithm of a node load by using a forward routing algorithm with a high transmission success rate and a flooding routing algorithm with low resource consumption; the algorithm is divided into two stages: a training stage and a transmission stage; 1), the training stage: the main task is to determine the node load and network load calculation parameters according to the selected routing algorithm, and determine a load interval applicable to each algorithm; and 2), the transmission stage: the main task is to calculate unexpired data according to a node load calculation formula defined in the training stage to obtain the node load, judge the load interval of the node load and the routing algorithm corresponding to the node interval; perform routing according to the routing algorithm; and meanwhile, update parameters required for calculating the node load defined in the training stage according to the routing condition of the hop, and update the corresponding load interval.

Description

1. Technical field [0001] The invention relates to the technical field of delay-tolerant networks, in particular to an adaptive DTN routing algorithm based on resource-limited conditions. 2. Background technology [0002] With the development of information technology, the emergence of Internet has greatly changed the production and lifestyle of human society. Internet network nodes always maintain an end-to-end connection path with low packet loss rate and low transmission delay. This type of network is based on the TCP / IP protocol cluster and is suitable for most network environments. However, with the continuous development of information technology, it is often necessary to deploy networks in some extreme environments. As a result, many scenarios that are different from traditional network characteristics have emerged. These networks are characterized by frequent link interruptions, high transmission delays, high packet loss rates, and asymmetric upstream and downstre...

AI Technical Summary

Problems solved by technology

The flood routing algorithm allows multiple copies of information to be included in the network to improve the success rate of network transmission. It is suitable for scenarios with abundant network resources. Typical flood routing algorithms include Epidemic, Spray and Wait, Spray and Focus, Multi-Simbet, etc.; The forwarding routing algorithm only allows at most one copy of information to exist in the network at the same time. The success rate of this type of algorithm is not as good as that of the flooding routing algorithm, but it is suitable for scenarios where resources are scarce

Images