考虑节点作战任务编成的战术互联网分簇算法

A Clustering Algorithm of TI Based on Operational Formation Node

分析了通用A d hoc网络分簇算法在实际战场环境下的不适应性,重点研究了任务编成和隶属关系等因素对战术互联网(T actica l In ternet,T I)性能的影响。针对战术互联网的应用环境,提出了考虑节点作战任务编成进行分簇的算法(O perationa l Form ation N ode cluster a lgorithm,OFN)思想,利用战术演习的部分数据进行了模拟实验,结果表明OFN算法能够减少簇的重构开销,增加战术互联网拓扑结构的稳定性。最后说明该算法能够为军队野战指挥系统建立提供一定的借鉴作用。

By presenting the inadaptability of Ad hoc Network cluster algorithms to the actual battlefield, the paper centers on the impacts of mission formation and mission subordination of operational columns on the functions of Tactical Internet （TI）. It then brings forward a TI cluster algorithms in consideration of Operational Formation Node （OFN） with regard to application of TI. Simulation experiments on basis of data from tactical maneuver show that OFN cluster algorithm can greatly reduce overhead out of cluster re-construction and effectively enhance stability of TI topology constitution. Finally the paper point out that OFN cluster algorithm is instructive to found operation command system.