基于社会性的容忍延迟网络路由算法研究

发布时间：2018-03-04 10:02

  本文选题：容忍延迟网络　切入点：社会性　出处：《哈尔滨工业大学》2014年硕士论文　论文类型：学位论文

【摘要】：难以预测的节点移动特性,全局信息的缺乏,使容忍延迟网络(Delay Tolerant Network,DTN)的路由算法设计极具挑战性。由于整个网络的结构随时间不断变化,没有一条确定的路径,所以传统的路由算法无法在当前网络环境工作,而采用“存储-携带-转发”的路由策略,节点在收到消息后,要对其进行长时间的存储,待到条件满足时再进行消息转发。研究者的研究重点往往集中在如何提高网络的递交成功率及降低网络的负载方面。近年来由于移动设备的普及,研究者开始将网络的社会特性加入到路由算法中。本文主要从节点之间的朋友关系方面构建算法模型。分析已有的基于朋友关系的路由算法的优缺点,发现该算法无法根据相遇时长分布特性对朋友关系进行评价,故在此基础上加入了相遇时长的分布特性的考虑,使其更能反映现实的情况。在缓存管理方面,分析已有的算法,以往算法只考虑自身节点的最大递交成功率,或者只考虑网络中的副本数而无法对每个副本重要性进行区分。所以本文通过记录副本所在的节点信息,提出了全局性的消息副本效用,对在网络中产生副本较多,已成功递交概率较高的消息的副本,赋予较低的权值,并以此来指导缓存管理。使用模拟器仿真实验,得到算法性能的各项指标:消息递交成功率,网络开销,平均传输时延等。通过与原有的基于朋友关系的算法对比后发现,除平均传输时延外其它两项性能均有小幅度的提升。改进算法与基于消息效用的缓存管理结合后,称之为NFCU(New Friendship with Copy Utility)。进行实验并与现有算法作比较,发现NFCU算法在缓存空间不足时,能达到优于其它算法的表现。
[Abstract]:The unpredictable mobility of nodes and the lack of global information make the routing algorithm design of delay tolerant delay network delay Tolerant network extremely challenging. Because the structure of the whole network changes over time, there is not a definite path. Therefore, the traditional routing algorithm can not work in the current network environment, and the routing strategy of "store-carry-forward" is adopted. After receiving the message, the node has to store it for a long time. Researchers often focus on how to improve the success rate of network delivery and reduce the network load. In recent years, due to the popularity of mobile devices, The researchers begin to add the social characteristics of the network to the routing algorithm. In this paper, we construct the algorithm model from the aspect of the friend relationship between nodes, and analyze the advantages and disadvantages of the existing friend relationship based routing algorithm. It is found that the algorithm can not evaluate the relationship between friends according to the characteristics of the long distribution of the encounter, so the consideration of the distribution of the length of the encounter is added to make it more realistic. In the aspect of cache management, the existing algorithms are analyzed. In the past, the algorithm only considered the maximum success rate of its own nodes, or could not distinguish the importance of each replica by considering only the number of replicas in the network. So this paper records the information of the nodes where the replicas are located. In this paper, the overall message replica utility is proposed, which can give lower weight to the copy of message with more replicas produced in the network and the higher probability of successful delivery, and can be used to guide the cache management. The simulator is used in the simulation experiment. The performance indexes of the algorithm are obtained, such as message delivery success rate, network overhead, average transmission delay and so on. In addition to the average transmission delay, the performance of the two methods has been improved by a small margin. After combining the improved algorithm with the message-based cache management, the improved algorithm is called NFCU(New Friendship with Copy Utility, and compared with the existing algorithms. It is found that the NFCU algorithm is superior to other algorithms when the cache space is insufficient.
【学位授予单位】：哈尔滨工业大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP393.02

【相似文献】

中国期刊全文数据库 前7条

1 王建新;李春泉;黄家玮;;高带宽延迟网络中路由器缓存需求的仿真分析[J];华南理工大学学报(自然科学版);2009年10期

2 许耀昌;新型高带宽低延迟网络──GSN[J];中国数据通讯网络;2000年01期

3 彭刚;;大带宽延迟网络的FASTTCP启动性能研究(英文)[J];深圳信息职业技术学院学报;2013年03期

4 许耀昌;新型高带宽低延迟网络——GSN[J];微电脑世界;1999年41期

5 巩军民;;长延迟网络控制系统的建模与稳定性分析[J];河北工业大学学报;2009年01期

6 许宁;边巴旺堆;许亮;;基于Merkle可信树的DTN网络分片认证研究[J];西藏大学学报(自然科学版);2012年01期

7 ;[J];;年期

中国硕士学位论文全文数据库 前4条

1 张晓函;基于社会性的容忍延迟网络路由算法研究[D];哈尔滨工业大学;2014年

2 孙宇;基于内容为中心网络的容忍延迟网络路由机制研究[D];北京邮电大学;2015年

3 黎志;高温超导无损脉冲功率延迟网络研究[D];华中科技大学;2009年

4 覃刚君;高速TCP协议在高带宽高延迟网络环境下的实验评估[D];华东师范大学;2012年

，

本文编号：1565170