TDMA战术数据链中最小时延抖动的固定时隙分配算法

现有TDMA战术数据链的时隙分配算法主要关注战术信息传输的时延,随着以数据链网络为中心的联合作战的深入发展,战术信息高实时性的传输需求日益凸显。提出一种基于最小时延抖动的固定时隙分配算法,首先将TDMA战术数据链时隙均匀分配问题转化为图论中包含确定边数的不含回路的最短路径环问题,然后采用动态规划法来求解这个包含确定边数的不含回路最短路径环问题并给出具体的算法步骤,最后进行仿真实验来验证算法的正确性和有效性,算法较好地满足了高实时性战术信息的传输需求。

A Minimum-Jitter Fixed Timeslot Allocation Algorithm for TDMA Tactical Data Link

Presently timeslot allocation algorithms for TDMA tactical data link mostly take account of the smallest transmission delay of tactical information.But with the deep development of joint operations which depend on tactical data link network,high real-time transmission of tactical information has become increasingly prominent.This paper proposes a Minimum-Jitter fixed timeslot allocation algorithm.Firstly,it translates the timeslot allocation problem for TDMA Tactical Data Link into the shortest path problem for graph consisting of certain edges and no loop ring.Secondly,it uses dynamic programming method to solve the shortest path problem and gives particular algorithm steps.Finally,it enumerates calculating case and processes simulation experiment to validate efficiency and correctness of the algorithm,the algorithm fully meets the high real-time transmission needs of tactical information.