协同作战中信息分发算法研究

Research on Information Distribution Algorithm for Cooperative Engagement

大规模协同作战中的高效通信问题为当前信息战的研究重点之一,但由于单独作战单元无法了解全局的信息内容及需求方,这给通信资源有限的参战兵力之间的态势共享带来了困难。为此提出了一个分布式协作信息分发算法,在理论上借鉴了复杂网络的小世界特性,即单元节点可以通过邻节点在较少跳数内完成信息的传输。在思路上利用了信息相关性概念,作战单元利用信息之间的关联性及信息与节点之间的收发关系建立控制信息发送的路由表。并通过仿真实验验证了不同网络拓扑下算法性能的变化情况,结果证明分发算法能较好地支持信息共享。

h is important for efficient communication in a large scale cooperative operation. However, it brings us difficulties to share information under the constraint of communication resources since the single unit cannot get the global knowledge of information content and the requester. Therefore a distributed cooperative message distribution algorithm is proposed, which is based on the small world property of complex networks that a node can transfer the messages among the network in a few hops. Furthermore, the route table is estimated on the relationship between pieces of information and nodes by adopting information relevance concept. Simulation experiments are performed to measure the algorithm performance based on different network topologies and the results verify its efficiency.