基于时间聚合图的DTN网络最短时延路由算法
Minimum delay algorithm based on time aggregated graph in DTN network
摘要
Abstract
The DTN network has the characteristics of dynamic topology change,thus the routing algorithm of static net-work can not solve the routing problem of time-varying network, and can not support fast transmission of given tasks. The existing time-variant routing algorithm CGR (contact graph routing) uses the earliest contact to obtain the shortest path, but because of the influence of the order of the connectivity period, the CGR algorithm has low link utilization. To solve this problem, the method of finding the shortest path was proposed. Besides, in order to characterize the relation between the different connect periods of the same link, the time series of node cache was added to the time aggregated graph. Based on this, the end-to-end multi-path shortest delay routing algorithm for the known task requirements was proposed. Finally, the feasibility of the algorithm was proved by an example.关键词
DTN网络/时间聚合图/最短路径/CGR算法Key words
DTN network/time aggregated graph/optimal path/CGR algorithm分类
信息技术与安全科学引用本文复制引用
王鹏,李红艳,张焘,李朋云..基于时间聚合图的DTN网络最短时延路由算法[J].通信学报,2017,38(z1):1-8,8.基金项目
国家重点研究发展计划基金资助项目(No.2016YFB0501004) （No.2016YFB0501004）
国家自然科学基金资助项目(No.91638202, No.91338115, No.61231008, No.61401326, No.61571351) （No.91638202, No.91338115, No.61231008, No.61401326, No.61571351）
国家科技重大专项基金资助项目(No.2015ZX03002006) （No.2015ZX03002006）
中央高校基础研究经费基金资助项目(No.WRYB142208, No.JB140117) （No.WRYB142208, No.JB140117）
111计划基金资助项目(No.B08038) （No.B08038）
陕西省自然科学基础研究计划基金资助项目(No.2016JQ6054)The National Key Research and Development Program of China (No.2016YFB0501004),The National Natural Science Foundation of China (No.91638202, No.91338115, No.61231008, No.61401326, No.61571351), National S&T Major Project (No.2015ZX03002006), The Fundamental Research Funds for the Central Universities (No.WRYB142208, No.JB140117), 111 Project (No.B08038), Natural Science Basic Research Plan in Shaanxi Province (No.2016JQ6054) （No.2016JQ6054）
