Routing Algorithm Research Based On LEO Satellite Network

LEO Satellite Network is provided with the advantages of lower orbit, shorter delay and simpler terminals (compared with GEO and HEO), etc, hence it has been broadly researched recently. In Satellite Network with links, information can be transmitted via a few kinds of paths, but the topological structure transforms rapidly and the transmit-ting paths break off easily, therefore, designing routing algorithms plays an important role in LEO Satellite Network.The main work and achievements of this paper are given below:1. Regarding the network of Iridium system as a directed acyclic graph (DAG), we prevented two algorithms for the shortest path problems in DGA. The algorithms work efficiently, with lower complexity comparing with the classical ones.2. Based on constrained delay, a new QoS routing model was provided, with Switching Rate and Blocking Rate added to the function of cost.3. According to the QoS model of minimum cost problem with delay constraint, we presented an optimal algorithm. Through constructing a sub-network with constraints and a cost-optimized sub-network, this algorithm reduced searching field in the solution space, and gave two strategies for different cost-optimized sub-networks, developing the searching performance.4. Considering the disadvantages of single-path protocols in communication system, we also studied the multi-path routing in this paper. As per different requirements, we presented an link-independent multi-path algorithm and an node-independent one, and the number k of independent paths could be determined according to applications.5. After transforming a kind of problem in Satellite Network communication into Fixed-charge Transportation Problem, we used the idea of intelligent searching algo-rithm for reference and put forward an adaptive tabu-search algorithm.