Single Routing Algorithm for Space Information System
Xiaoling Gao · Aerospace Shanghai · 2008
The single routing algorithm with the longest duration time under multi constrained conditions for space information system was studied in this paper. The bound of the optimal solution of the multi constrained routing was gained by Lagrange to reduce the solution set of the searching routing.The multi constrained routing form the source to the aim was calculated by Dijkstra algorithm.The steps of the routing algorithm were given out.The simulation results showed that time delay and handover of this routing algorithm was better than those of routing algorithm of linear fwnction.