Routing method for data transmission in space delay/disruption tolerant network

Abstract

The invention discloses a routing method for data transmission in a space delay / disruption tolerant network. The routing method comprises the following steps: (1) searching for a static route: if no static route exists, executing dynamic route calculation; and (2) calculating a dynamic route: calculating the dynamic route according to a source node for transmitting data and a destination node by the following substeps: (2.1) calculating the minimum delay route; (2.2) testing the capacity of the route; and (2.3) selecting a next-hop node: comparing delays of all the selected routes, and selecting the minimum delay route. According to the invention, the routing method is based on space delay / disruption tolerant network capacity constraints of a node contact relational graph in the network, and the minimum delay route from the source node to the destination node can be calculated by precognizing a contact relation graph among nodes in the running process of the whole network and data streams among node pairs, so that the throughput of the whole network can be increased, the space node resources can be saved, and higher network performance can be obtained.

Description

technical field [0001] The invention mainly relates to the field of network communication, in particular to a routing method for data transmission in a space delay-tolerant and break-tolerant network. Background technique [0002] The Internet has achieved great success in interconnecting communication devices around the world. It uses the TCP / IP protocol cluster as a homogeneous communication protocol set, which can shield network heterogeneity. However, in TCP / IP, there are also many assumptions about the underlying transport protocol; for example: there must be a continuous end-to-end path between the sending and receiving nodes, the RTT between any sending and receiving nodes is small and relatively consistent, and the communication link error Rate and packet loss rate are low, etc. However, in recent years, many emerging networks have emerged, and these networks have very distinctive characteristics: high latency, low data rate in path and link characteristics, and sta...

AI Technical Summary

Problems solved by technology

[0013] However, neither the flooding routing strategy for the terrestrial DTN network nor the contact graph routing protocol for the interplanetary network has made full use of the relevant prior knowledge information such as the contact relationship graph and data flow information in the network. Data transmission may fail during data routing and transmission

Images