相遇概率与中心方向位置在战场容迟容断网络分簇中的应用  

Application of Encounter Probability and CDP in Battlefield Delay/Disruption Tolerant Network Clustering

作　　者：和何 李琳琳 路云飞 HE He;LI Linlin;LU Yunfei(Department of Information Engineering,Rocket Force University of Engineering,Xi＇ an 710025,China)

机构地区：[1]火箭军工程大学信息工程系,西安710025

出　　处：《计算机工程》2018年第7期98-102,108,共6页Computer Engineering

基　　金：国家高技术研究发展计划项目(2012AA7010213)

摘　　要：针对战场容迟容断网络(B-DTN)缺少稳定的端到端通信链路且存在间歇性连接等缺陷,为提高各作战单元之间的消息投递率,依据相遇概率进行分簇。基于经典的喷射等待路由算法设计簇内路由,将节点的向心性与运动角度相综合的结果作为簇间选择最佳中继节点的判定指标。仿真结果表明,该分簇路由机制相比于Clustering和无方向分簇路由机制,在保证高投递率的同时也有效降低了平均端到端延迟。Considering the shortcomings of unstable end-to-end communication link and intermittent interruption in Battlefield Delay/Disruption Tolerant Network（ B-DTN）,in order to improve message delivery ratio,the nodes are clustered according to the encounter probability. The intra-cluster routing is designed based on classical spray and wait.The result of combining the centripetalism and motion angle of the node is taken as the decision index of choosing the optimal relay node in inter-cluster. Simulation results show that the proposed cluster routing mechanism evidently achieves high delivery ratio and low average end-to-end delay in comparison with the algorithm of Clustering and clustering routing mechanism without direction.

关 键 词：战场容迟容断网络 相遇概率 分簇 喷射等待 向心性 运动角度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]