本文選題：容忍延遲網絡　切入點：社會性　出處：《哈爾濱工業(yè)大學》2014年碩士論文　論文類型：學位論文

【摘要】：難以預測的節(jié)點移動特性,全局信息的缺乏,使容忍延遲網絡(Delay Tolerant Network,DTN)的路由算法設計極具挑戰(zhàn)性。由于整個網絡的結構隨時間不斷變化,沒有一條確定的路徑,所以傳統(tǒng)的路由算法無法在當前網絡環(huán)境工作,而采用“存儲-攜帶-轉發(fā)”的路由策略,節(jié)點在收到消息后,要對其進行長時間的存儲,待到條件滿足時再進行消息轉發(fā)。研究者的研究重點往往集中在如何提高網絡的遞交成功率及降低網絡的負載方面。近年來由于移動設備的普及,研究者開始將網絡的社會特性加入到路由算法中。本文主要從節(jié)點之間的朋友關系方面構建算法模型。分析已有的基于朋友關系的路由算法的優(yōu)缺點,發(fā)現該算法無法根據相遇時長分布特性對朋友關系進行評價,故在此基礎上加入了相遇時長的分布特性的考慮,使其更能反映現實的情況。在緩存管理方面,分析已有的算法,以往算法只考慮自身節(jié)點的最大遞交成功率,或者只考慮網絡中的副本數而無法對每個副本重要性進行區(qū)分。所以本文通過記錄副本所在的節(jié)點信息,提出了全局性的消息副本效用,對在網絡中產生副本較多,已成功遞交概率較高的消息的副本,賦予較低的權值,并以此來指導緩存管理。使用模擬器仿真實驗,得到算法性能的各項指標:消息遞交成功率,網絡開銷,平均傳輸時延等。通過與原有的基于朋友關系的算法對比后發(fā)現,除平均傳輸時延外其它兩項性能均有小幅度的提升。改進算法與基于消息效用的緩存管理結合后,稱之為NFCU(New Friendship with Copy Utility)。進行實驗并與現有算法作比較,發(fā)現NFCU算法在緩存空間不足時,能達到優(yōu)于其它算法的表現。
[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.
【學位授予單位】：哈爾濱工業(yè)大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.02

【相似文獻】

中國期刊全文數據庫 前7條

1 王建新;李春泉;黃家瑋;;高帶寬延遲網絡中路由器緩存需求的仿真分析[J];華南理工大學學報(自然科學版);2009年10期

2 許耀昌;新型高帶寬低延遲網絡──GSN[J];中國數據通訊網絡;2000年01期

3 彭剛;;大帶寬延遲網絡的FASTTCP啟動性能研究(英文)[J];深圳信息職業(yè)技術學院學報;2013年03期

4 許耀昌;新型高帶寬低延遲網絡——GSN[J];微電腦世界;1999年41期

5 鞏軍民;;長延遲網絡控制系統(tǒng)的建模與穩(wěn)定性分析[J];河北工業(yè)大學學報;2009年01期

6 許寧;邊巴旺堆;許亮;;基于Merkle可信樹的DTN網絡分片認證研究[J];西藏大學學報(自然科學版);2012年01期

7 ;[J];;年期

中國碩士學位論文全文數據庫 前4條

1 張曉函;基于社會性的容忍延遲網絡路由算法研究[D];哈爾濱工業(yè)大學;2014年

2 孫宇;基于內容為中心網絡的容忍延遲網絡路由機制研究[D];北京郵電大學;2015年

3 黎志;高溫超導無損脈沖功率延遲網絡研究[D];華中科技大學;2009年

4 覃剛君;高速TCP協議在高帶寬高延遲網絡環(huán)境下的實驗評估[D];華東師范大學;2012年

，

本文編號：1565170