An effective routing algorithm for LEO satellite constellation

Considering that low earth orbit (LEO) satellite constellation networks composed of small satellites have limited computing capability and storage resource and current constellation routing algorithms can adapt to dynamic network topology but they call for critical requirements of computing capability and storage resource, the paper proposes a simple and effective off-line computing-based routing algorithm, after analyzing the characteristics of practical LEO satellite constellation networks. The algorithm not only provides a reliable route, but also provides a traffic adaptive scheme by backup paths. The analysis of algorithm complexity and simulation results show that the proposed algorithm has lower onboard overload and better end-to-end delay performance. This simple and effective routing algorithm can be applied to practical LEO satellite constellation networks.