|
The low orbit satellite network has features such as high-speed information transmission and on-planet routing exchange, in which the satellite-ground feeder link (the link between the satellite in the space segment and the gateway station in the ground segment) realising high-speed bidirectional communication between the satellite and the gateway station on the ground, and performing important functions such as user access to the terrestrial network and control and monitoring of the satellite by the ground management and control center. In fact, the satellites in the low orbit constellation move at high speed relative to the ground, and the feeder link from the low orbit satellites to the gateway station has a lot of mobile switching, so it is necessary to solve the routing addressing problem between the gateway station and the satellites under the conditions of dynamic switching of the feeder link in the low orbit satellite network, which is the need to design the link table between the satellites and the gateway station at the engineering level. However, the complex configuration of low-orbit giant communication constellations, the large number of satellites and the suddenness of working modes have brought great challenges to the generation of link strategies for the constellation satellites and the ground gateway stations at the system level. In order to solve the problem of efficiently generating link building strategies for giant constellations and many gateway stations, this paper proposes a dynamic and autonomous link table building algorithm based on maximum matching of bipartite graphs. First, a low-orbit constellation model and an access model of low-orbit constellations and gateway stations are established based on orbital dynamics, then a dynamic autonomous generation algorithm based on maximum matching of bipartite graphs is designed to balance the system load, and finally simulations a re performed to validate the algorithm in typical application scenarios. The simulation results show that the dynamic autonomous chain building strategy based on maximum matching of bipartite graph for giant constellation feeder catching and following proposed in this paper is universal, which can improve the autonomous operation capability of the system a nd reduce the operation cost of the system.
|
