基于DTN历史队列预测的单播路由算法  

Unicast routing algorithm of earliest deliver based on historical orderliness prediction in DTN

作　　者：杜帅[1] 安建伟[1] 刘倩[1] 陈月云[1] 周贤伟[1] 

机构地区：[1]北京科技大学计算机与通信工程学院通信工程系,北京100083

出　　处：《计算机应用研究》2013年第11期3442-3444,3454,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(61170225;61170014)

摘　　要：容迟容断网络(delay tolerant networks,DTN)具有连接频繁间断、高延迟、高误码率、高丢包率等特点。良好稳健的路由算法是提高消息转发成功率、降低延迟和能耗、提高DTN通信能力的重要因素。为此设计了一种基于历史队列预测的单播路由算法(earliest deliver based on historical orderliness prediction,EDHO)。仿真结果表明该算法可有效地提高DTN消息传递的可靠性。Delay tolerant networks（DTN） often have intermittent connection, high delay, high bit error ratio and packet loss rate. Excellent and robust routing algorithm is an important factor for increasing message forwarding rate, reducing delay, improving communication capability in DTN. So the paper designed a kind of earliest deliver routing algorithm based on historical orderliness prediction. Simulation results show that EDHO improves effectively the reliability of message delivery in DTN.

关 键 词：容迟容断网络 知识预测 路由算法 

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