基于容量约束的深空接触图路由算法

Contact Graph Routing Algorithm Based on Capacity Constraints in Deep Space Communication

为有效利用节点间通信机会保证数据的可靠传输,提出一种基于容量约束的接触图路由算法。一方面,该算法通过比较节点接触的剩余容量和预计容量损耗计算最早到达路径,避免所选路径后续节点没有足够的容量。另一方面,数据包的转发节点数由反馈的链路状态和网络拓扑关系自适应决定,在网络性能和资源消耗中得到平衡。仿真表明,该算法能提高数据包投递率最高27.7%,端到端传输时延最高降低24.5%,有效应对深空恶劣环境的影响。

To reduce the influence of long delay and high bit error rate in deep space routing,and to effective use the limited communication opportunities between nodes to ensure the reliable transmission,a contact graph routing algorithm based on capacity constraints is proposed. On the one hand,it compares the residual capacity（ RC）of nodes＇ contact with the estimated capacity consumption（ ECC） of the packet to avoid nodes does not have enough capacity. On the other hand,the number of forwarding node is calculated by the feedback of link state and network topology,which gets the balance between performance and resource consumption. Simulation shows that this algorithm not only can improve the packet delivery rate significantly,but also reduce the end-to-end transmission delay,which effectively adapt to deep space environment.