战术数据链动态时隙分配算法研究

摘要

针对战术数据链网络中信息资源的分配问题,以战术数据链时隙分配算法为研究对象,在深入分析两种典型时隙分配算法的基础上,提出了一种动态时隙分配算法.仿真结果表明该动态时隙分配算法灵活性较好,较轮询与TDMA固定时隙分配算法,其能够更好地适应瞬息万变的战场需求.%The tactical data link network takes an important role in modern information war. Based on the analysis of two typical slot allocation algorithms, this paper presents a dynamic slot allocation algorithm. Simulation result shows that this algorithm has the advantage of more flexibility and better adaptability of battlefield than polling algorithm and fixed TDMA allocation algorithm.