Abstract: In satellite network, there are task conflicts which arise from communication application between several satellites and a satellite at the same time. In order to solve the problem, this paper proposes a dynamic priority-based scheduling algorithm. In the established satellite communication task model, the urgency of the task is used to express time constraints both deadline for tasks and spare time. The task urgency is used to control to the influence of the task priority by adjusting the parameter p according to the characteristics of the satellite network. A conflict model is built by STK scene to do simulation, and experimental results show that the algorithm enhances task completion rate by 3.9% than FCFS algorithm.

Key words: satellite network, communication conflict, real-time tas, dynamic priority, urgency, scheduling algorithm

摘要： 在卫星网络中多颗卫星同时对一颗卫星进行通信申请会产生任务冲突问题。为此，提出一种基于动态优先级的调度算法。建立卫星通信任务模型，利用任务执行紧迫性表达任务截止期与空余时间这2个时间约束，并根据卫星网络的特点，通过调整参数p控制紧迫性对任务优先级的影响程度。利用STK场景建立冲突模型进行仿真实验，结果证明该算法的任务完成率相比FCFS算法提高了3.9%。

关键词: 卫星网络, 通信冲突, 实时任务, 动态优先级, 紧迫性, 调度算法

CLC Number: 

• TP301.6