Routing method for deep space delay tolerant network based on historical delivery events

Abstract

The present invention relates to a deep-space delay-tolerant network routing method based on historical submission events, comprising the steps of: a. In the process of creating nodes, if the total number of nodes is N, set N-1 delivery probability values ​​for each node P respectively calibrates the delivery probability of this node to other nodes; b. Add a data table for each bundled layer message header to store the forwarding path of the bundled layer message, when a node participates in the relay forwarding of the bundled layer message , store the node number in the header data table of the binding layer message; c. when a binding layer message reaches the destination node, apply the incentive mechanism to all nodes on the path; d. when a binding layer in the node When the message needs to be deleted due to timeout, the deprivation mechanism is applied to this node; e. When two nodes meet, extract the delivery probability value of both parties to the destination node of the binding layer message and compare its size; f. Repeat the above step a~ In step e, the delivery of the binding layer message is realized.

Description

technical field [0001] The invention relates to the technical field of network communication, in particular to a deep space delay-tolerant network routing method based on historical delivery events. Background technique [0002] In the deep space network, due to the movement of nodes, the network topology presents dynamic changes, with characteristics such as long delay, high bit error rate and intermittent connection. Therefore, the traditional end-to-end connection-based TCP / IP protocol (Transmission Control Protocol / Internet Protocol, Transmission Control Protocol / Internet Internet Protocol) cannot show excellent performance in the deep space network data transmission service. [0003] To overcome this problem, the Deep Space Network uses a Delay Tolerant Network (DTN) for data transmission. DTN provides data transmission services for potential heterogeneous networks by introducing a bundle layer (Bundle Layer, BP) on the transport layer or other bottom layers. The bund...

AI Technical Summary

Problems solved by technology

[0005] Although various algorithms have recently been proposed for the routing problem of deep-space delay-tolerant networks, due to the dynamic characteristics of DTN network topology changes, the randomness of link interruptions, and the large delays in the network, routing algorithm design There are still many problems and challenges. For example, the difference in algorithm application scenarios is relatively large. The data forwarding efficiency of existing routing algorithms is low. Nodes cannot forward data well in combination with their own characteristics and network status. Flood forwarding will cause waste of resources. Fixed forwarding may cause forwarding failure, algorithm reliability and effectiveness must be considered

Images