中国空间科学技术

中国空间科学技术 ›› 2018, Vol. 38 ›› Issue (3): 76-84.doi: 10.16708/j.cnki.1000-758X.2018.0028

• 技术交流 • 上一篇    

天基信息港的多源信息融合任务调度研究

王之1，邓畅霖1，郭薇1,*，朱维各2   

  1. 1. 上海交通大学 区域光纤通信网与新型光通信系统国家重点实验室，上海  200240
    2. 上海卫星工程研究所，上海  200240
  • 收稿日期:2017-11-10 修回日期:2018-01-05 接受日期:2018-03-14 出版日期:2018-06-25 发布日期:2018-03-06
  • 通讯作者: 郭薇（1963-），女，教授，wguo@sjtu.edu.cn，研究方向为网络资源管理与调度
  • 作者简介:王之（1993-），男，硕士研究生，1034132593@sjtu.edu.cn，研究方向为卫星资源调度

Research on multi-source information fusion task scheduling of space-based information port#br#

WANG Zhi1, DENG Changlin1, GUO Wei1,*, ZHU Weige2   

  1. 1. State Key Lab of Advanced Optical Communication Systems and Network, Shanghai Jiaotong University, Shanghai 200240, China
    2. Shanghai Institute of Satellite Engineering, Shanghai 200240, China
  • Received:2017-11-10 Revised:2018-01-05 Accepted:2018-03-14 Published:2018-06-25 Online:2018-03-06

PDF (PC)

65

摘要： 在天基信息港上实现多源信息融合，可以将数据的传输与处理集中在星上，减少了数据处理中心接收和分发数据的传输时间，提高了信息获取的时效性。考虑到任务高时效性的需求及天基信息港的资源受限，文章提出了天基信息港的多源信息融合任务调度问题，通过分析多源信息融合任务流程、天基信息港的资源特征，以最小化任务完成时间为优化目标，建立了天基信息港的多源信息融合任务调度模型，并设计了一种多机循环插入（Multi-machine Circular Insertion，MCI）算法对模型求解。仿真结果表明，该算法相比于列表调度算法能够平均减少10.8%的任务完成时间，算法运行时间大约为遗传算法的1/20，表明该算法能够满足天基信息港任务调度的高时效性要求。

关键词: 天基信息港, 多源信息融合, 任务调度, 可见时间窗, 多机循环插入算法

Abstract:

To achieve multi-source information fusion in the space-based information port, the data can be transmitted and processed on the satellite, and the transmission time of receiving and distributing data in the data center can be reduced. It can improve the timeliness of information acquisition. Considering the high timeliness requirement of task and the limited resources of the space-based information port, a multi-source information fusion task scheduling problem was proposed. By analyzing the task flow of multi-source information fusion and resource characteristics of the space-based information port, a multi-source information fusion task scheduling model was established to minimize the task completion time, and a multi-machine circular insertion (MCI) algorithm was designed to solve the model. Simulation results show that compared with the Johnson list algorithm, the algorithm can reduce the task completion time by 10.8%, and the running time of the algorithm is about 1/20 of the genetic algorithm, which proves that the algorithm can meet the high timeliness of task scheduling of space-based information port.

Key words:

"> Space-based information port, multi-source information fusion, task scheduling, time window, multi-machine circular insertion algorithm