卫星网络时隙分配算法与路由规划优化

星间链路的应用在增加网络连通性和提升网络性能方面是至关重要的。然而, 对于大规模、高动态的卫星网络, 实时的星间链路设计和路由规划变得非常有挑战性。为了克服这个难点, 本文研究了动态卫星网络中的时隙分配与路由规划问题, 并将其建模为一个整数线性规划问题。为了降低问题求解的复杂度, 该问题被近似地分解为两个独立的子问题, 包括时隙分配问题与路由规划问题。第一个子问题仍然是一个整数规划问题, 本文结合匹配理论与拉格朗日松弛方法设计了一个低复杂度但是高效的求解算法。然后, 针对第二个子问题, 考虑业务的优先级, 设计了一个低花费的路由算法。最后, 仿真结果验证了方法的可行性与有效性。

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

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.