A Scheduling Algorithm for Solving Communication Conflict in Satellite Network

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.