Time delay tolerant network shortest time delay routing method based on dynamic interval limitation

Abstract

The invention discloses a time delay tolerant network shortest time delay routing method based on dynamic interval limitation, and solves the problems of large memory space and a large amount of redundant calculation in the prior art. The method comprises the following implementation steps: firstly, constructing a discrete time aggregation graph, and converting all link transmission delay sequences in the discrete time aggregation graph into node arrival time sequences through node arrival time sequence conversion; and determining a dynamic interval limiting condition according to the relationship between the node arrival time sequence of the link and the corresponding moment, and calculating the shortest delay route between the nodes under the fixed starting time according to the condition. The storage requirement of method execution is effectively saved, a large amount of redundant calculation is reduced, and the communication overhead of the delay tolerant network is reduced.

Description

technical field [0001] The invention belongs to the technical field of communication, and further relates to a shortest delay routing method of a delay-tolerant network DTN (Delay-Tolerant NetWorks) based on dynamic interval limitation in the technical field of network communication. The invention can select a shortest time-delay route for end-to-end transmission in the time-delay tolerant network DTN, so as to ensure the high efficiency of information transmission. Background technique [0002] Delay Tolerant Network (DTN) is a new type of self-organizing network, which can be widely used in military, transportation, disaster relief and other fields because it can communicate under network constraints such as end-to-end round-trip extension and frequent connection interruptions. prospect. Compared with the traditional communication network, the delay tolerant network DTN has no stable end-to-end transmission path, and the routing algorithm in the traditional communication ...

AI Technical Summary

Problems solved by technology

The disadvantage of this method is that using the time expansion graph to store time-varying network information will cause problems such as large storage capacity, redundant nodes, and repeated calculations, which will increase the communication overhead of the network.

The disadvantage of this method is that the shortest path is calculated directly based on the node arrival time series without any processing, which leads to an increase in the computational complexity of the method execution and increases the communication overhead of the network

Images