Welcome to Journal of University of Chinese Academy of Sciences,Today is

Journal of University of Chinese Academy of Sciences

    Next Articles

Research on beam hopping scheduling strategy of LEO communication satellite based on improved genetic algorithm

ZHANG Panpan1,2, CHANG Jiachao3, ZOU Cheng1,2, LI Guotong1,3,4†   

  1. 1 Innovation Academy for Microsatellites, Chinese Academy of Sciences, Shanghai 201304, China;
    2 University of Chinese Academy of Sciences, Beijing 100049, China;
    3 Shanghai Yuanxin Satellite Technology Co., Ltd, Shanghai 201600, China;
    4 ShanghaiTech University, Shanghai 201210, China
  • Received:2023-02-22 Revised:2023-05-12

Abstract: Low earth orbit (LEO) communication satellites can break through terrain constraints and work with 6G to build an integrated space-ground information network. In terms of the beam scheduling problem of satellites for fixed terminals on the ground, a beam scheduling strategy that can achieve dual optimization of interference and delay is proposed, considering that the uneven distribution of global user demands exists. The model with the optimization goal of minimizing the queuing delay and co-channel interference is constructed, combining with constraints such as transmit power as well as carrier-to-noise ratio. By the means of step-by-step optimization, a beam-hopping scheme including demand clustering, time slot allocation and beam position matching is designed. When it comes to the interference optimization problem in the beam position matching process, a genetic algorithm-based chromosome crossover mechanism of "beam position self-crossover within a cluster" is proposed. The simulation results show that the improved genetic algorithm can reduce the co-channel interference by 32% to 58% compared with the other algorithm. Besides, the proposed strategy can schedule the beam within the resource allocation period while achieving dual optimization of delay and interference.

Key words: LEO satellite, beam-hopping, scheduling strategy, genetic algorithm

CLC Number: