于时间序列预测的延迟容忍网络路由算法-北京邮电大学学报.pdfVIP

2011 年 12 月 北京邮电大学学报 Dec.2011 第34 卷第6 期 loumal of Beijing University of Posts and Telecommunications Vo l. 34 No.6 文章编号: 1007-5321 (2011) 06 -D091-04 于时间序列预测的延迟容忍网络路由算法 杨斌， 田勇，檀保钮，章立军 (北京科技大学国家材料服役安全科学中心，北京 100086) 摘要:提出了一种基于时间序列预测的延迟容忍网络路由算法.采用改进的加权移动平均时间序列预测算法，利 用不断积累的历史链接信息，预测链路未来链接状态，构建路由表信息.该算法不要求节点具备先验知识，能随着 网络拓扑的变化调整消息的传输路径，克服了同类算法需要大量网络链接先验知识的弊端.仿真结果表明，与最小 期望延迟、最小估计期望延迟算法相比，该算法具有更高的传输成功率和更低的平均传输延迟. 关键词:加权移动平均;时间序列预测;延迟容忍网络;路由算法 中图分类号: TN915.03 文献标志码:A A New Routing Algorithm Based on Time Series Prediction in Delay Tolerant Networks YANG Bin , TIAN Yong , TAN Li-meng , ZHANG Li-jun (National Center for Materials Service Safety , University of Science and Technology Beijing , Beijing 100086 , China) Abstract: A routing algorithm based on time series prediction for delay tolerant network is proposed. The weight moving average method as one of time series prediction methods is improved , and the history con- nected information of nodes is used to predict the connection state in the future. The characteristic of the proposed algorithm include that it does not need any network connection information , and the routing path can change followed with the change of network topology. The proposed algorithm can avoid the shortcom- ing of existing algorithm which needs prior knowledge. Simulation shows that the proposed algorithm com- pared with minimum expected delay and minimum estimated expected delay have higher delivery ratio and lower average time. Key words: weighted moving average; time series prediction; delay tolerant networks; routing a