A Space-Time Graph Based Multipath Routing in Disruption-Tolerant Earth-Observing Satellite Networks
A Space-Time Graph Based Multipath Routing in Disruption-Tolerant Earth-Observing Satellite Networks
复制标题
耐干扰地球观测卫星网络中基于时空图的多路径路由
DOI：
10.1109/taes.2019.2938447
复制
发表时间：
2019-10-01
影响因子：
4.4
通讯作者：
Yuan, Peng
中科院分区：
文献类型：
--
作者：
Jiang, Fu;Zhang, Qinyu;Yuan, Peng
在本文中，我们考虑基于中断容忍网络的地球观测卫星网络中的路由问题，该网络的特点是拓扑频繁变化以及潜在的稀疏和间歇性连接。为了应对这些属性带来的路由挑战，我们为这些网络提出了一种联合时空路由算法框架，其中时变拓扑被建模为利用卫星相对运动的可预测性的时空图。基于该图模型，我们设计了一种多路径路由算法[最小成本约束多路径（MCMP）]来寻找一组可行的可用路由路径，通过该算法可以将一定量的任务数据在可容忍的延迟内以最小的成本传输回地面站。为了比较评估MCMP的性能，我们在典型的联系图路由算法的基础上设计了一种最早到达多路径路由策略（EAMP）算法。对MCMP、EAMP和直接传输策略之间的性能比较进行了仿真和分析。
In this paper, we consider the problem of routing in disruption-tolerant-networking-based earth-observing satellite networks, which are characterized by a frequently changing topology and potentially sparse and intermittent connectivity. To handle the routing challenges posed by these properties, we propose a joined space-temporal routing algorithmic framework for those networks, where the time-varying topology is modeled as a space-time graph leveraging the predictability of satellites' relative motions. Based on this graph model, we devise a multipath routing algorithm [minimum-cost constrained multipath (MCMP)] to find a feasible set of available routing paths, through which a certain amount of mission data can be transferred back to ground stations within a tolerable delay with a minimum cost. To comparatively evaluate the performance of MCMP, moreover, we design an earliest arrival multipath routing policy (EAMP) algorithm based on the typical contact graph routing algorithm. The performance comparisons among MCMP, EAMP, and direct transfer strategy are simulated and analyzed.