Abstract
To overcome the low timeliness of resource scheduling problems in spatial information networks, we propose a method based on a dynamic reconstruction of resource request queues and the autonomous coordinated scheduling of resources. First, we construct a small satellite network and combine the graph maximum flow theory to solve the link resource planning problem during inter-satellite data transmission. In addition, we design a multi-satellite resource scheduling algorithm with minimal time consumption based on graph theory. The algorithm is based on graph theory to reallocate the resource request queue to satellites with idle processing resources. Finally, we simulate the efficient resource scheduling capability in the spatial information network and empirically compare our approaches against two representative swarm intelligence baseline approaches and show that our approach has significant advantages in terms of performance and time consumption during resource scheduling.
Funder
National Natural Science Foundation of China under Grant
National Natural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference45 articles.
1. Joint Transmit Power and Bandwidth Allocation for Cognitive Satellite Network Based on Bargaining Game Theory
2. Game theoretic power allocation and waveform selection for satellite communications;Shu,2015
3. Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
4. A satellite network resource scheduling mechanism based on reinforcement learning;Zhou;Comput. Eng. Sci.,2019
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献