本文選題：容遲網絡　切入點：路由算法　出處：《南京郵電大學》2017年碩士論文　論文類型：學位論文

【摘要】：容遲網絡(Delay Tolerent Network,DTN)的特殊之處在于連接間斷性、長或可變延遲、較高的誤碼率以及非對稱的數據率。DTN網絡缺乏端到端的持續(xù)穩(wěn)定連接,傳統(tǒng)通信的路由技術及擁塞控制策略不能很好地應用于DTN網絡,因此探索適用于DTN的路由及擁塞控制策略一直是人們的研究重點。Epidemic及PROPHET(Probabilistic routing protocol using history of encounters and transitivity)路由算法是研究者們提出的兩種基礎性路由算法。Epidemic路由算法采用病毒感染類似的機制將消息傳遞給任何一個不攜帶該消息的節(jié)點,能迅速的將消息散發(fā)到網絡中去。但在實際應用中,這種方式大量消耗了本就不充裕的DTN存儲與帶寬資源,極易引起網絡擁塞。PROPHET利用節(jié)點歷史相遇信息來估算與目的節(jié)點相遇的概率,只將消息傳遞給與消息目的節(jié)點相遇可能性更大的節(jié)點;這種方式較Epidemic更節(jié)省資源,但散發(fā)消息的速度較慢,也沒有考慮節(jié)點緩存占用率帶來的影響,有時會做出不合理的決策。為了改進上述不足,本文基于這兩種路由算法提出了一種新的路由算法,即PROPHETSE(PROPHET with Source Epidemic)路由算法。該路由算法不僅能以較快速度散發(fā)消息,還考慮了節(jié)點緩存占用率對轉發(fā)的影響。仿真結果顯示,PROPHET-SE路由算法能以較小的開銷及時延成功傳遞更多的消息。此外,本文還針對基于PROPHET-SE路由算法的擁塞控制做了較為深入的研究,并給出了一種基于歸一化混合參數的丟包策略。仿真結果表明,這種復合的丟包策略可以使消息遞交率、開銷及時延三個性能指標達到較優(yōu)的平衡。
[Abstract]:Delaytolerant network (Delay Tolerent Network, DTN) special lies in connecting discontinuities, long or variable delay, high bit error rate and asymmetric data rate.DTN network end to end the lack of sustained and stable connection, the traditional communication routing and congestion control strategy cannot be effectively applied to DTN network, so the exploration suitable for DTN routing and congestion control strategy has been the research focus of.Epidemic and PROPHET (Probabilistic routing protocol using people history of encounters and transitivity) routing algorithm is the researchers proposed two basic routing algorithm for.Epidemic routing algorithm with similar mechanism of virus infection to deliver a message to any one does not carry the message node, can rapid message will be distributed to the network. But in practical application, this method consumes a large amount of DTN and the storage is not sufficient Bandwidth, extremely easy to cause the network congestion by using.PROPHET node information to estimate the probability of historical encounter encounter with the destination node, only the message to the message destination node is more likely to encounter node; this way saves more than Epidemic resources, but the distribution of news is slow, did not consider the influence of the occupancy rate of the node cache. Sometimes make irrational decisions. In order to overcome these deficiencies, this paper the two kinds of routing algorithm is proposed based on a new routing algorithm, namely PROPHETSE (PROPHET with Source Epidemic) routing algorithm. This algorithm can not only faster dissemination of news, also considering the node cache occupancy rate of forwarding. The simulation results show that PROPHET-SE routing algorithm can use less overhead and delay the successful delivery of more information. In addition, this paper also based on PROPHET-SE routing algorithm Congestion control has been deeply studied, and a packet loss policy based on normalized mixed parameters has been given. Simulation results show that this composite packet loss strategy can make message delivery rate, overhead and delay three performance indicators to achieve a better balance.

【學位授予單位】：南京郵電大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TN915.0

【參考文獻】

相關期刊論文 前9條

1 夏奕;鄧廣宏;;DTN分發(fā)網絡中基于數據投遞概率的擁塞控制機制[J];通信學報;2015年S1期

2 石樂;胡愛群;;關于機會網絡及其信息安全的思考[J];密碼學報;2015年04期

3 于振;徐敬東;張建忠;張玉;;基礎設施增強的DTN路由協(xié)議[J];通信學報;2013年08期

4 張振京;金志剛;舒炎泰;;基于節(jié)點運動預測的社會性DTN高效路由[J];計算機學報;2013年03期

5 朱鐵英;崔艷茹;李童;周治國;張日明;;基于社會性的DTN網絡路由算法研究[J];計算機工程;2012年14期

6 張俊寶;羅光春;李炯;陳愛國;;延遲容忍網絡路由協(xié)議研究[J];計算機應用研究;2012年03期

7 王朕;王新華;隋敬麒;;機會網絡模擬器ONE及其擴展研究[J];計算機應用研究;2012年01期

8 劉期烈;潘英俊;李云;趙玲;;延遲容忍網絡中基于復制率的擁塞控制算法[J];北京郵電大學學報;2010年04期

9 樊秀梅;單志廣;張寶賢;陳輝;;容遲網絡體系結構及其關鍵技術研究[J];電子學報;2008年01期

相關碩士學位論文 前1條

1 左民樂;基于社會網絡的可容忍延遲路由算法研究[D];上海師范大學;2010年

，

本文編號：1626600