基于邻居节点位置的受控传染DTN路由算法  

Controlled Epidemic Routing Algorithm in DTN Based on Neighbor Node Location

作　　者：李建波[1] 由磊[1] 姜山[1] 戴晨曲 徐吉兴 

机构地区：[1]青岛大学信息工程学院,山东青岛266071

出　　处：《计算机工程》2014年第8期76-85,共10页Computer Engineering

基　　金：山东省自然科学基金资助项目"多策略的容延网络路由算法研究"(ZR2013FQ022);青岛市科技计划基础研究基金资助项目"容迟网络中的路由算法研究"(12-1-4-2-(14)-jch);山东省高等学校科技计划基金资助项目"机会网络中的路由算法研究"(J14LN85)

摘　　要：针对容迟网络(DTN)拓扑频繁割裂、间歇连接等特点,利用余弦定理,提出一种基于一跳邻居节点信息的下一跳节点选择算法,并基于此实现受控传染路由算法LC-Epidemic。LC-Epidemic算法不对全局拓扑知识信息做任何假设,只利用一跳以内节点的位置信息。实验结果表明,当节点移动相对缓慢并且消息生命周期较短时,LCEpidemic算法的消息投递率逼近于Epidemic算法,然而其网络开销却只有后者的50%。在消息生命周期较短的情况下,当节点的缓存资源不是限制路由算法性能的瓶颈因素时,LC-Epidemic算法在投递时延方面好于Binary Spray&Wait以及FirstContact算法。Aiming at the problem of handling network partitions and intermittently link connectivity in Delay Tolerant Network（DTN）,this paper proposes a Location-based Controlled Epidemic （LC-Epidemic） routing protocol for DTN.LC-Epidemic assumes each node be aware of its position without relying on other prior global topology knowledge,whichmakes it be more practical and reliable than some existing routing schemes.Performances of different routing strategies are then evaluated by simulations,and the results indicate that LC-Epidemic achieves an approximately high delivery ratio compared with Epidemic protocol,while introducing only 50％ overheads to the network when the nodes move in a comparatively slow way and the messages have a short Time to Live（TTL）.When the TTL of each message is set to be short,LC-Epidemic outperforms Binary Spray ＆ Wait and First Contact protocols in average latency as long as the buffer resources of nodes is not a bottleneck factor in limiting the routing performance.

关 键 词：容迟网络 路由协议 余弦定理 受控传染路由 节点位置 

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