本文選題：容忍延遲網(wǎng)絡(luò)　切入點(diǎn)：社會(huì)性　出處：《哈爾濱工業(yè)大學(xué)》2014年碩士論文　論文類(lèi)型：學(xué)位論文

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

【相似文獻(xiàn)】

中國(guó)期刊全文數(shù)據(jù)庫(kù) 前7條

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

2 許耀昌;新型高帶寬低延遲網(wǎng)絡(luò)──GSN[J];中國(guó)數(shù)據(jù)通訊網(wǎng)絡(luò);2000年01期

3 彭剛;;大帶寬延遲網(wǎng)絡(luò)的FASTTCP啟動(dòng)性能研究(英文)[J];深圳信息職業(yè)技術(shù)學(xué)院學(xué)報(bào);2013年03期

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

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

6 許寧;邊巴旺堆;許亮;;基于Merkle可信樹(shù)的DTN網(wǎng)絡(luò)分片認(rèn)證研究[J];西藏大學(xué)學(xué)報(bào)(自然科學(xué)版);2012年01期

7 ;[J];;年期

中國(guó)碩士學(xué)位論文全文數(shù)據(jù)庫(kù) 前4條

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

2 孫宇;基于內(nèi)容為中心網(wǎng)絡(luò)的容忍延遲網(wǎng)絡(luò)路由機(jī)制研究[D];北京郵電大學(xué);2015年

3 黎志;高溫超導(dǎo)無(wú)損脈沖功率延遲網(wǎng)絡(luò)研究[D];華中科技大學(xué);2009年

4 覃剛君;高速TCP協(xié)議在高帶寬高延遲網(wǎng)絡(luò)環(huán)境下的實(shí)驗(yàn)評(píng)估[D];華東師范大學(xué);2012年

，

本文編號(hào)：1565170