A Tunable Routing Algorithm for Integerated Terrestrial-Satellite Networks Based on the Space-Time Graph

Integrated terrestrial-satellite networks have the advantages of wide coverage, long communication distance, strong mobile access capability, which form a good complementary relationship with 5G cellular network and have a bright future. However, integrated terrestrial-satellite network is a typical DTN network with time varying topology, in which whole end-to-end paths are hardly to be established. It is significant to design a routing algorithm for the integrated terrestrial-satellite networks. In order to solve the routing problem of satellite network, in this paper, a space-time graph model is first constructed. Inspired by the minimum-cost constrained multipath routing (MCMP) algorithm, a minimum-delay constrained multipath routing (MDMP) algorithm is proposed to minimize routing delay. Furthermore, a tunable minimum-delay-cost constrained multipath routing (TMMP) algorithm is proposed, which considers the optimization of both routing delay and energy cost with linear weighting method. Simulation results prove the effectiveness of MDMP algorithm and TMMP algorithm.