The integrated routing algorithm for multi-satellites, multi-ground-stations and multi-processing-centers

The research of routing planning for satellites and ground stations always treats the whole process as two independent parts: transmission from satellites to ground stations and transmission in the ground networks. The separate research causes two problems that the two parts could not connect tightly and the delay is large. In order to solve these problems, the paper designs an integrated routing algorithm that treats the transmission as a whole. The algorithm considers the real-time link cost, calculates the normalization matrix, and searches the best real-time link for transmission. Simulation results show that comparing with the separate optimal solution, the integrated solution reduces the delay of the task sequences while keeping the sum of successful task priority and task success rate almost the same. The integrated routing algorithm improved the performance of routing planning for satellites and ground stations.

[1]  Wei-Cheng Lin,et al.  Daily imaging scheduling of an Earth observation satellite , 2003, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[2]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3]  Yingwu Chen,et al.  Simulation-based scheduling for photo-reconnaissance satellite , 2005, Proceedings of the Winter Simulation Conference, 2005..

[4]  Virginie Gabrel Strengthened 0-1 linear formulation for the daily satellite mission planning , 2006, J. Comb. Optim..