A Real-Time Distributed Algorithm for Satellite Constellation Routing

This paper presents a real-time distributed routing algorithm for satellite constellation. This algorithm divides the satellite cycle into as few time slices as possible according to the on-off condition of inter-orbit links of satellites, and the subnet of inter-satellite links is expanded to a plane, in each time slice the coordinates of satellites are mapped to the corresponding latitudes. Use the method of latitude comparison and combine the real-time inter-satellite link states to calculate the routing and the forward table for the next jump of the target in each satellite. The real-time inter-satellite link state is derived from the link state broadcast based on the breadth first tree algorithm, which guarantees the real-time updating of the link states. This algorithm is based on the combination of precalculation and distributed real-time onboard calculation, which aim to improve the real-time performance and reduce the onboard calculation load.