A Low Complexity And Efficient Algorithm for LEO Satellite Routing

The Dijkstra algorithm has been widely used in the routing protocol design. However, the shortest path tree calculation method based on the Dijkstra algorithm fails to take advantage of the characteristics of the graph structure in topologies of satellite networks and incurs a heavy computational burden. In this paper, we propose a low-complexity and efficient algorithm for satellite routing according to the special topology and link latency distribution of LEO satellite constellations. The simulation results show that the proposed scheme achieves the same optimal performance as the Dijkstra algorithm but with much-reduced complexity. In particular, under the network scale of 60×30, the average calculation time of our algorithm is less than $\frac{1}{{10}}$ of that of the Dijkstra algorithm.