系统工程与电子技术 ›› 2026, Vol. 48 ›› Issue (4): 1441-1449.doi: 10.12305/j.issn.1001-506X.2026.04.33

• 通信与网络 • 上一篇    

基于时间切片的打击链通信资源动态调度算法

朱品蝶(), 吕娜   

  1. 空军工程大学信息与导航学院,陕西 西安 710077
  • 收稿日期:2024-12-26 修回日期:2025-03-31 出版日期:2025-05-23 发布日期:2025-05-23
  • 通讯作者: 吕娜 E-mail:zpindie@163.com
  • 作者简介:朱品蝶(2001—)女,硕士研究生,主要研究方向为航空数据链、打击链

Dynamic scheduling algorithm of communication resources for kill chains based on time-slicing

Pindie ZHU(), Na LYU   

  1. School of Information and Navigation,Air Force Engineering University,Xi’an 710077,China
  • Received:2024-12-26 Revised:2025-03-31 Online:2025-05-23 Published:2025-05-23
  • Contact: Na LYU E-mail:zpindie@163.com

摘要:

打击链信息流的快速流动是实现目标有效打击的关键。信息流随机并行生成,其在各作战环节对通信资源的需求不同,需求的时间也不同;局部空战场中,通信资源有限、节点高机动阻碍了信息流需求的及时保障。为此,提出基于时间切片的打击链通信资源动态调度算法,将作战时段分割成多个时间切片依次处理,并将通信需求与资源的调度建模为二分图匹配问题。根据对节点计算、存储、链路带宽的不同需求,以信息流动时间和资源利用率为优化目标调度合适的节点链路。仿真表明,通信资源动态调度算法实现了通信资源有限下多条打击链信息流快速的流动。

关键词: 空中作战, 打击链, 资源分配, 动态分配, 二分图匹配

Abstract:

The rapid flow of the kill chain information flow is key to effectively striking targets. Information flows are generated randomly and in parallel, with varying demands for communication resources at different combat stages and different timeliness requirements. In local air combat, limited communication resources and high mobility of nodes hinder the timely provision of information flow demands. Therefore, a time-slicing-based dynamic scheduling algorithm for kill chain communication resources is proposed, which divides the combat time into multiple time slices for sequential processing and models the scheduling of communication demands and resources as a bipartite graph matching problem. Based on different requirements for node computation, storage, and link bandwidth, the algorithm optimizes the scheduling of appropriate node links with information flow time and resource utilization rate as the optimization objectives. Simulation results show that the dynamic scheduling algorithm of communication resources enables the rapid flow of information streams in multiple kill chains under the constraint of limited communication resources.

Key words: air combat, kill chain, resource allocation, dynamic allocation, bipartite graph matching

中图分类号: