No abstract

Low-orbit micro-satellite technology has developed rapidly in recent years due to its advantages of low time delay, low cost and short research period. However, among the existing inter-satellite routing algorithms, the classical flooding and greedy algorithms and their derivatives also have some limitations. The path delay calculated by the flooding algorithm is small but the calculation is large, while the greedy algorithm is the opposite. In this paper, a balanced inter-satellite routing algorithm based on partition routing is proposed. This paper presents the simulation experiments for the following indexes of the classic inter-satellite routing algorithms and the balanced partition routing algorithm: computation complexity, single-node computation pressure, routing path delay, path delay variance (data in Topo table satisfy μ =5, σ2=10). The results reveal that the balanced partition routing algorithm achieves better performance. In this paper, two optimization directions of the balanced partition routing algorithm are simulated under conditions that the data in the Topo table satisfy μ =5, σ2= 6, σ2=10 and σ2=15, respectively, when comparing their performance indicators. The experiments show that these two optimization methods can be adapted to various application scenarios and can further reduce the hardware cost of satellite nodes.