Systems Engineering and Electronics ›› 2026, Vol. 48 ›› Issue (4): 1441-1449.doi: 10.12305/j.issn.1001-506X.2026.04.33

• Communications and Networks • Previous Articles    

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

CLC Number: 

[an error occurred while processing this directive]