计算机工程2017，Vol.43Issue(1)：144-152,9.DOI:10.3969/j.issn.1000-3428.2017.01.025
DTN中基于动态多维度组合的拓扑图路由算法
Topological Graph Routing Algorithm Based on Dynamic Multidimensional Combination in DTN
摘要
Abstract
In order to improve the delivery hit ratio and reduce network transmission delay and network overhead of data packet in Delay Tolerant Network (DTN),the Topological Graph routing algorithm based on Dynamic Multidimensional Combination(TGDMC)is proposed.Each node dynamically selects nodes that rank in the top s level with the node itself in multiple dimensions to form the relative static local topological graph.As time goes on,the dynamic selection is reflected in the change of the node sets that constitute the local topological graph of each node.According to the continuous meeting between nodes,each node expands its topological graph.Floyd shortest path algorithm is used to obtain the best transfer node set of each node to forward the data packet.Simulation results show that,compared with the Prophet routing algorithm,Bubble Rap routing algorithm and SimBet routing algorithm,the proposed algorithm has a better improvement on average transmission delay,delivery hit ratio and network overhead.关键词
延迟容忍网络/动态多维度组合/动态选择/多维度/局部拓扑图/最佳传递集合Key words
Delay Tolerant Network (DTN)/dynamic multidimensional combination/dynamic selection/multidimensional/local topologial graph/best transfer set分类
信息技术与安全科学引用本文复制引用
贾建鑫,刘广钟,徐明..DTN中基于动态多维度组合的拓扑图路由算法[J].计算机工程,2017,43(1):144-152,9.基金项目
国家自然科学基金(61202370) （61202370）
中国博士后科学基金(2014M561512) （2014M561512）
上海市教委科研创新项目(12ZZ151,14YZ110). （12ZZ151,14YZ110）
