Accurate qualitative probability weighted delayed routing method based on node cyclic moving mode

Abstract

The invention provides an accurate qualitative probability weighted delayed routing method based on a node cyclic moving mode. The method comprises steps of: 1, neighbor node discovery including thata node moves cyclically and broadcasts Hello packets periodically to seek for neighbor nodes; 2, delay table updating including that the node maps sought neighbor node addresses and link delays between nodes into a delay table; and based on the inter-node link delay, the probability-weighted time delay between the nodes is calculated by using an inter-node contact probability and is updated and stored in the delay table instead of inter-node link delay; and 3, routing computation including that the shortest route is calculated by using the weighted time delay in the time-delay table as the weight of a node edge, the next hop address reaching a destination node is added to a routing table, and messages are forwarded according to the routing table. The weighted time delay calculated based onthe contact probability can reflect a link cost characteristic more effectively than a traditional time delay.

Description

technical field [0001] The invention belongs to the technical field of routing in delay tolerant networks (Delay Tolerant Networks, DTN), and in particular relates to an accurate qualitative probability weighted delay routing method in a cyclic movement mode. Background technique [0002] The DTN network does not necessarily have an end-to-end transmission path, which is the biggest feature that differentiates it from the traditional Internet. Fast-moving communication nodes, limited communication range, and scarce network energy resources make the connection of DTN networks frequently interrupted, resulting in long delays and network segmentation in such networks. The DTN network uses the store-carry-forward mechanism to process the message transmission of the disconnected nodes. The routing technology is the core of the DTN network, which refers to the method of finding an effective path between the source node and the destination node to successfully deliver the message. ...

AI Technical Summary

Problems solved by technology

[0004] The object of the present invention is to provide a kind of accurate qualitative probabilistic weighted time-delay routing method based on node cyclic movement pattern, solve the network routing problem of node cyclic movement pattern such as satellite network and vehicle-mounted mobile network, deterministic delay in MED routing technology On the basis of time thinking, the node contact probability is considered as an important parameter in routing design, and on the basis of traditional delay, the average link delay is calculated with probability weighting

Images