容迟网络中基于节点间亲密度的分组路由方法  

Packet-based routing algorithm in DTN based on the intimacy between nodes

作　　者：王恩[1] 杨永健[1] 赵卫丹 刘林璐 

机构地区：[1]吉林大学计算机科学与技术学院,吉林长春130012 [2]吉林大学软件学院,吉林长春130012

出　　处：《通信学报》2014年第12期70-77,共8页Journal on Communications

基　　金：国家自然科学基金资助项目(61272412);教育部博士点基金资助项目(20120061110044);吉林省科技发展计划重点基金资助项目(20120303)~~

摘　　要：借鉴MANET中通过分簇来减少冗余副本和社交网络中有关挖掘社交圈的思想,通过分析节点的移动规律,定义了基于节点间亲密度的拓扑结构,并将该亲密度在拓扑图中量化为可以比较的边的权值,依据边的权值大小进行拓扑裁剪,挖掘出相互亲密度较高的节点分组,并且针对源节点和目的节点所在的分组对spray and wait路由方法进行改进,来决定本身的报文副本的分配情况,进而提出了基于节点间亲密度的分组路由方法(PBI)。实验结果表明,该路由方法能够明显地提高投递成功率并且减小网络时延。Through analyzing the moving law of nodes,the topology is defined based on intimacy between nodes by using the thoughts of reducing redundant copies through clustering in MANET and mining social community in social network for reference.Take topological trim according to the weight of edges and dig out groups of nodes which have higher intimacy degree.And also improve the spray and wait routing protocol according to the group of source and destination nodes.Then put forward a packet-based routing algorithm in DTN based on the intimacy between nodes.Simulation result shows that this routing algorithm could effectively increase the delivery ratio and reduce delay.

关 键 词：容迟网络 社交网络 亲密度 分组 

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