相遇概率与中心方向位置在战场容迟容断网络分簇中的应用
|
摘要
针对战场容迟容断网络(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.
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.
引文
[1]PHILIP G,VALTTERI N,JORG O.Fragmentational agorithms for DTN links[J].Computer Communications,2013,36(3):279-290.
[2]VAHDAT A.Epidemic routing for partially connected Ad Hoc networks[D].Durham,USA:Duke University,2000.
[3]SPYROPOULOUS T,PSOUNIS K,RAGHAVENDRA C S.Spray and wait:an efficient routing scheme for intermittently connected mobile networks[C]//Proceedings of ACMSIGCOMM Workshop on Delay-tolerant Networking.New York,USA:ACM Press,2005:252-259.
[4]LINDGREN A,DORIA A.Probabilistic routing in intermittently connected networks[J].Mobile Computing and Communications Review,2003,7(3):19-6.(下转第页102
[5]王秀磊,陈鸣,张国敏,等.一种分簇DTN中分层多摆渡节点路由机制[J].中国科技论文,2012,7(7):503-505.
[6]王恩,杨永健,赵卫丹,等.容迟网络中基于节点间亲密度的分组路由方法[J].通信学报,2014,35(12):70-77.
[7]张振京,金志刚,舒炎泰,等.基于节点运动预测的社会性DTN高效路由[J].计算机学报,2013,36(3):626-635.
[8]王恩,杨永健,李莅,等.基于动态半马尔科夫路径搜索模型的DTN分簇路由方法[J].计算机学报,2015,38(3):483-499.
[9]韩毅,方滨兴,贾焰,等.基于密度估计的社会网络特征簇挖掘方法[J].通信学报,2012,33(5):38-48.
[10]李陟,李千目,张宏.基于最近社交圈的社交时延容忍网络路由策略[J].计算机研究与发展,2012,49(6):1185-1195.
[11]周瑞涛,曹元大,胡晶晶.基于社区的容迟网络路由方法[J].北京理工大学学报,2012,32(9):966-970.
[12]韩万强,刘云.WSN中基于分簇的改进路由协议[J].计算机工程,2012,38(5):105-107,113.
[13]应俊,杨慧娉,王汝言.带有相遇概率估计的机会网络缓存替换策略[J].上海交通大学学报,2015,49(11):1680-1684.
[14]SPYROPOULOS T,PSOUNIS K,RAGHAVENDRA C S.Performance analysis of mobility-assisted routing[C]//Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing.New York,USA:ACM Press,2006:49-60.
[15]DALY E M,HAAHR M.Social network analysis for information flow in disconnected delay-tolerant MANETs[J].IEEE Transactions on Mobile Computing,2009,8(5):606-621.
[16]ARI K,JORG O,TEEMU K.The ONE simulator for DTN protocol evaluation[C]//Proceedings of the 2nd International Conference on Simulation Tools and Techniques.New York,USA:ACM Press,2009.
[17]DANG H,WU H.Clustering and cluster-based routing protocol for delay-tolerant mobile networks[J].IEEETransactions on Wireless Communications,2010,9(6):1874-1881.编辑顾逸斐
[2]VAHDAT A.Epidemic routing for partially connected Ad Hoc networks[D].Durham,USA:Duke University,2000.
[3]SPYROPOULOUS T,PSOUNIS K,RAGHAVENDRA C S.Spray and wait:an efficient routing scheme for intermittently connected mobile networks[C]//Proceedings of ACMSIGCOMM Workshop on Delay-tolerant Networking.New York,USA:ACM Press,2005:252-259.
[4]LINDGREN A,DORIA A.Probabilistic routing in intermittently connected networks[J].Mobile Computing and Communications Review,2003,7(3):19-6.(下转第页102
[5]王秀磊,陈鸣,张国敏,等.一种分簇DTN中分层多摆渡节点路由机制[J].中国科技论文,2012,7(7):503-505.
[6]王恩,杨永健,赵卫丹,等.容迟网络中基于节点间亲密度的分组路由方法[J].通信学报,2014,35(12):70-77.
[7]张振京,金志刚,舒炎泰,等.基于节点运动预测的社会性DTN高效路由[J].计算机学报,2013,36(3):626-635.
[8]王恩,杨永健,李莅,等.基于动态半马尔科夫路径搜索模型的DTN分簇路由方法[J].计算机学报,2015,38(3):483-499.
[9]韩毅,方滨兴,贾焰,等.基于密度估计的社会网络特征簇挖掘方法[J].通信学报,2012,33(5):38-48.
[10]李陟,李千目,张宏.基于最近社交圈的社交时延容忍网络路由策略[J].计算机研究与发展,2012,49(6):1185-1195.
[11]周瑞涛,曹元大,胡晶晶.基于社区的容迟网络路由方法[J].北京理工大学学报,2012,32(9):966-970.
[12]韩万强,刘云.WSN中基于分簇的改进路由协议[J].计算机工程,2012,38(5):105-107,113.
[13]应俊,杨慧娉,王汝言.带有相遇概率估计的机会网络缓存替换策略[J].上海交通大学学报,2015,49(11):1680-1684.
[14]SPYROPOULOS T,PSOUNIS K,RAGHAVENDRA C S.Performance analysis of mobility-assisted routing[C]//Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing.New York,USA:ACM Press,2006:49-60.
[15]DALY E M,HAAHR M.Social network analysis for information flow in disconnected delay-tolerant MANETs[J].IEEE Transactions on Mobile Computing,2009,8(5):606-621.
[16]ARI K,JORG O,TEEMU K.The ONE simulator for DTN protocol evaluation[C]//Proceedings of the 2nd International Conference on Simulation Tools and Techniques.New York,USA:ACM Press,2009.
[17]DANG H,WU H.Clustering and cluster-based routing protocol for delay-tolerant mobile networks[J].IEEETransactions on Wireless Communications,2010,9(6):1874-1881.编辑顾逸斐