战术数据链中一种启发式时隙分配算法  

Heuristic Slot Assignment Algorithm for Tactical Data Link

作　　者：林万里[1] 武欣嵘[2] 王帅[1] 

机构地区：[1]解放军理工大学通信工程学院研究生1队,江苏南京210007 [2]解放军理工大学通信工程学院

出　　处：《军事通信技术》2014年第4期60-64,共5页Journal of Military Communications Technology

摘　　要：在战术数据链中,现有的时隙分配算法主要关注战术信息传输的时延指标,而对时延抖动指标考虑较少。为了满足战术信息传输的时延抖动指标以及实时性的特点,提出一种基于最小时延抖动的启发式时隙分配算法。首先将时隙分配问题描述为一个规划问题,而后将该规划问题映射成有向完全图中的求解含确定边数的不含回路最短循环有向径环问题,最后给出具体的算法步骤。仿真结果检验了算法的有效性,算法能够通过提高计算量来获得时延抖动更小的时隙分配方案,能够满足战术信息的传输需求。In the TDL（Tactical Data Link）,most slot assignment algorithms take the transmission delay of the tactical information as the quality of service,while the delay jitter is always ignored.In order to meet the requirements of the delay jitter and real-time characteristics for the transmission of the tactical information,a heuristic slot assignment algorithm was proposed based on the minimum delay jitter.The slot assignment problem was described as a programming problem.And then the programming problem was mapped to a graphics problem to seek a shortest loop-free circular directional ring with a fixed number of edges in a directional complete graph.Finally,the detail of the algorithm was presented.The simulation result shows that the algorithm is effective and obtains a slot allocation scheme with less delay jitter by increasing the amount of computation,and that it is able to meet the requirement for transmission of the tactical information.

关 键 词：战术数据链 时延抖动 有向完全图 循环有向路径 

分 类 号：TN92[电子电信—通信与信息系统]