Systems Engineering and Electronics ›› 2022, Vol. 44 ›› Issue (4): 1343-1353.doi: 10.12305/j.issn.1001-506X.2022.04.33

• Communications and Networks • Previous Articles     Next Articles

Optimization of time slot allocation algorithm and routing scheduling for satellite network

Ruisong WANG1, Ruofei MA1, Qi WANG2, Zhicong ZHONG1, Gongliang LIU1,*, Yang ZHANG3   

  1. 1. School of Information Science and Engineering, Harbin Institute of Technology, Weihai 264209, China
    2. Beijing Institute of Tracking and Telecommunications Technology, Beijing 100094, China
    3. Aerospace Dongfanghong Satellite Co., Ltd., Beijing 100094, China
  • Received:2021-02-03 Online:2022-04-01 Published:2022-04-01
  • Contact: Gongliang LIU

Abstract:

The inter-satellite links play a crucial role in increasing network connectivity and improving network performance. However, it is very challenging to design the real time inter-satellite links and routing scheme for large scale and high dynamic satellite networks. To overcome this difficulty, this paper studies the time slot allocation and routing scheduling problem for dynamic satellite networks, and then formulates it as an integer linear programming problem. To decrease the solving complexity, the proposed problem is approximatively decomposed into two independent subproblems, namely, the time slot allocation problem and the routing scheduling problem. To deal with the integer programming in the first subproblem, the matching theory and the Lagrangian relaxation method are used to design a low complexity but efficient algorithm. Moreover, for the second subproblem, we design a low cost routing algorithm considering the priorities of the missions. Finally, the simulation results verify the feasibility and effectiveness of the proposed method.

Key words: satellite network, Lagrange relaxation, time slot allocation, routing scheduling

CLC Number: 

[an error occurred while processing this directive]