Dynamic priority dispatching method of satellite network many-to-one communication conflicts

Abstract

A dynamic priority dispatching method of satellite network many-to-one communication conflicts belongs to the satellite communication network field. The method includes calculating the time window of a current satellite communication task, judging whether the time window of the communication task is larger than the minimum execution time of the communication task, calculating the priority of the communication task if the communication task is larger than the minimum execution time of the communication task, judging whether the priority of the current satellite communication task is the highest by a target satellite, and communicating with the current satellite if the priority of the current satellite communication task is the highest. The method has the advantages that randomness of the communication task is considered, the method is suitable for relay satellite communication system with fixed or random communication tasks; the change of the task priority dynamic can fully utilize the task spare time, so that the communication time of the satellite is improved; the algorithm is simple, the needed resources are less, and the method is suitable for satellite communications with limited communication resources.

Description

technical field [0001] The technical field of the invention is a satellite communication network, in particular, it relates to a dynamic priority scheduling method for many-to-one communication conflicts in a satellite network. Background technique [0002] With the continuous development of satellite technology, satellite communication network occupies an increasingly important position in the field of communication. However, the communication resources of a single satellite are limited, and there are more and more communication conflicts in the satellite communication network, among which the main one is the many-to-one conflict of relay satellites. At present, the method to resolve such conflicts is mainly to reasonably schedule the relay satellite tasks in the satellite network. [0003] At present, according to domestic and foreign literature, the scheduling methods to solve such conflicts mainly include: mixed integer programming, insertion algorithm and replacement a...

AI Technical Summary

Problems solved by technology

[0003] At present, according to domestic and foreign literature, the scheduling methods to solve such conflicts mainly include: mixed integer programming, insertion algorithm and replacement algorithm, etc. The algorithm is suitable for situations where there are few data transmission tasks and relatively simple constraints; the priority segmentation algorithm, proposed by Wang Yuanzhen et al. Heuristic scheduling algorithms such as the method of optimal scheduling of equipment, this type of algorithm greatly simplifies the problem, but there is a certain gap in solving practical problems, and it is difficult to apply in practice; Yan Zhiwei et al. In terms of sensor scheduling, the parallel taboo genetic algorithm has been studied. Li Yunfeng et al. ("System Engineering Theory and Practice", 2008) proposed intelligent scheduling algorithms such as the satellite data transmission hybrid scheduling algorithm based on this genetic algorithm. Task scheduling response is not sensitive enough

Images