DTN中基于节点相遇规律的自适应散发等待路由  

AN ADAPTIVE BINARY SPRAY AND WAIT ROUTING ALGORITHM BASED ON NODE ENCOUNTER LAW IN DTN

作　　者：丁安平[1] 马蓓蕾[1] 王炳庭[2] 

机构地区：[1]安徽大学计算智能与信号处理教育部重点实验室,安徽合肥230000 [2]滁州学院电子电气工程学院,安徽滁州239000

出　　处：《计算机应用与软件》2016年第5期124-126,168,共4页Computer Applications and Software

摘　　要：在容滞网络中,针对散发等待BSW(Binary Spray and Wait)路由协议在转发报文时具有一定的盲目性。提出将每个节点维护的路由信息由一维拓展到二维,并在该基础上研究节点的相遇规律,动态地调整报文转发策略,从而解决当前节点与信宿节点相遇概率较低的问题。实验结果表明,该算法与散发等待路由相比,在降低平均延迟的基础上,能有效改善报文的递交率。In delay-tolerant networking（ DTN）,Binary Spray and Wait（ BSW） routing protocol has a certain blindness when forwarding messages. To deal with this issue,we propose to expand the routing information maintained by each node from one dimension to two dimensions,and study on this basis the encounter law of nodes as well as adjust dynamically the messages forwarding strategy,thereby solve the problem of low encounter possibility of current nodes and the destination nodes. Experimental results show that the proposed algorithm can effectively enhance message delivery rate on the basis of reducing the average latency compared with BSW routing.

关 键 词：容滞网络 路由 二维矩阵H 相遇规律 散发等待 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]