Task Scheduling Method for Data Relay Satellite Network Considering Breakpoint Transmission

被引:34
作者
Chen, Xinjiang [1 ]
Li, Xiamiao [1 ]
Wang, Xinwei [2 ]
Luo, Qizhang [1 ]
Wu, Guohua [1 ]
机构
[1] Cent South Univ, Sch Traff & Transportat Engn, Changsha 410073, Peoples R China
[2] Queen Mary Univ London, Sch Elect Engn & Comp Sci, London E1 4NS, England
基金
中国国家自然科学基金;
关键词
Task analysis; Scheduling; Satellites; Space vehicles; Relays; Resource management; Orbits; Breakpoint transmission; data relay satellite network; parameter self-adaptive; tabu list; variable neighborhood descent; satellite scheduling;
D O I
10.1109/TVT.2020.3046304
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The increasing demands for space-based data transmission pose a great challenge to task scheduling of tracking and data relay satellites (TDRSs). In order to improve the working efficiency and task completion rate of the data relay satellite network (DRSN), for the first time, we propose a novel application mode for DRSN, in which data breakpoint transmission is considered. In the mode of data breakpoint transmission, a single task can be reasonably split into multiple subtasks and thus scheduled in multiple time windows. At first, the task scheduling model of DRSN considering breakpoint transmission is defined. In addition, a two-stage method is designed to generate a high-quality initial solution. Moreover, we propose an adaptive variable neighborhood descent combined with a tabu list (AVND-TL) to iteratively improve the initial solution. In AVND-TL, two task reallocation neighborhood structures are incorporated and adaptively selected during the solution search process, which effectively prevent the algorithm from falling into local optimum. Finally, extensive experiments are carried out to verify that the proposed breakpoint transmission mode and AVND-TL together can significantly improve the task completion rate and resource utilization rate.
引用
收藏
页码:844 / 857
页数:14
相关论文
共 54 条
[1]   Parameterized Schemes of Metaheuristics: Basic Ideas and Applications With Genetic Algorithms, Scatter Search, and GRASP [J].
Almeida, Francisco ;
Gimenez, Domingo ;
Juan Lopez-Espin, Jose ;
Perez-Perez, Melquiades .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2013, 43 (03) :570-586
[2]   On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks [J].
Andres Fraire, Juan ;
Madoery, Pablo G. ;
Finochietto, Jorge M. .
IEEE SENSORS JOURNAL, 2014, 14 (11) :3874-3882
[3]   A tabu search algorithm for the split delivery vehicle routing problem [J].
Archetti, C ;
Speranza, MG ;
Hertz, A .
TRANSPORTATION SCIENCE, 2006, 40 (01) :64-73
[4]   Complexity of the VRP and SDVRP [J].
Archetti, Claudia ;
Feillet, Dominique ;
Gendreau, Michel ;
Speranza, M. Grazia .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2011, 19 (05) :741-750
[5]   A hybrid metaheuristic algorithm for a parallel machine scheduling problem with dependent setup times [J].
Baez, Sarahi ;
Angel-Bello, Francisco ;
Alvarez, Ada ;
Melian-Batista, Belen .
COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 131 :295-305
[6]   Planning and scheduling algorithms for the COSMO-SkyMed constellation [J].
Bianchessi, Nicola ;
Righini, Giovanni .
AEROSPACE SCIENCE AND TECHNOLOGY, 2008, 12 (07) :535-544
[7]   The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints [J].
Bianchessi, Nicola ;
Drexl, Michael ;
Irnich, Stefan .
TRANSPORTATION SCIENCE, 2019, 53 (04) :1067-1084
[8]   NASAS ADVANCED TRACKING AND DATA RELAY SATELLITE SYSTEM FOR THE YEARS 2000 AND BEYOND [J].
BRANDEL, DL ;
WATSON, WA ;
WEINBERG, A .
PROCEEDINGS OF THE IEEE, 1990, 78 (07) :1141-1151
[9]   A research survey: review of AI solution strategies of job shop scheduling problem [J].
Calis, Banu ;
Bulkan, Serol .
JOURNAL OF INTELLIGENT MANUFACTURING, 2015, 26 (05) :961-973
[10]  
Chang HS, 1998, IEEE T VEH TECHNOL, V47, P1037, DOI 10.1109/25.704858