An Improved Contact Graph Routing Algorithm Based on Delay Constraints
Xuefei Liu, Tao Zhang · 2018
The Contact Graph Routing (CGR) algorithm uses the scheduled contact between nodes to calculate the route. When the contact plan and the actual situation are inconsistent, the CGR will be invalid. In addition, CGR does not consider the link state and queuing delay, which may lead to excessive end-to-end delay or even bundle expired. In view of the above problems, this paper proposes a CGR routing decision mechanism that considers the link state, queuing delay and the reliability of contact plan, and determines the best path by defining a delay factor. The simulation results show that the improved algorithm has a great improvement in both end-to-end delay and packet loss rate, especially in the case of limited resources, the performance is better.