Abstract:

The routing technology plays a key role in the LEO early warning constellation network.The topological structure of this network is designed. A multi constrained optimal path (MCOP) model is proposed for this network. This model defines the cost of paths using delay, handover probability and the available bandwidth of links, and shows the delay and hop count constrained least cost path problem. An algorithm is given to find the optimal solution to the MCOP problem. This algorithm greatly reduces the computational amount by decreasing the searching field of feasible paths. Simulation results show that the routing algorithm is superior to other current algorithms in the aspects of computing complexity and handover performance, indicating the adaptability for on line routing.