本文選題：容遲網(wǎng)絡(luò)　切入點(diǎn)：路由算法　出處：《南京郵電大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：容遲網(wǎng)絡(luò)(Delay Tolerent Network,DTN)的特殊之處在于連接間斷性、長(zhǎng)或可變延遲、較高的誤碼率以及非對(duì)稱的數(shù)據(jù)率。DTN網(wǎng)絡(luò)缺乏端到端的持續(xù)穩(wěn)定連接,傳統(tǒng)通信的路由技術(shù)及擁塞控制策略不能很好地應(yīng)用于DTN網(wǎng)絡(luò),因此探索適用于DTN的路由及擁塞控制策略一直是人們的研究重點(diǎn)。Epidemic及PROPHET(Probabilistic routing protocol using history of encounters and transitivity)路由算法是研究者們提出的兩種基礎(chǔ)性路由算法。Epidemic路由算法采用病毒感染類似的機(jī)制將消息傳遞給任何一個(gè)不攜帶該消息的節(jié)點(diǎn),能迅速的將消息散發(fā)到網(wǎng)絡(luò)中去。但在實(shí)際應(yīng)用中,這種方式大量消耗了本就不充裕的DTN存儲(chǔ)與帶寬資源,極易引起網(wǎng)絡(luò)擁塞。PROPHET利用節(jié)點(diǎn)歷史相遇信息來(lái)估算與目的節(jié)點(diǎn)相遇的概率,只將消息傳遞給與消息目的節(jié)點(diǎn)相遇可能性更大的節(jié)點(diǎn);這種方式較Epidemic更節(jié)省資源,但散發(fā)消息的速度較慢,也沒(méi)有考慮節(jié)點(diǎn)緩存占用率帶來(lái)的影響,有時(shí)會(huì)做出不合理的決策。為了改進(jìn)上述不足,本文基于這兩種路由算法提出了一種新的路由算法,即PROPHETSE(PROPHET with Source Epidemic)路由算法。該路由算法不僅能以較快速度散發(fā)消息,還考慮了節(jié)點(diǎn)緩存占用率對(duì)轉(zhuǎn)發(fā)的影響。仿真結(jié)果顯示,PROPHET-SE路由算法能以較小的開(kāi)銷及時(shí)延成功傳遞更多的消息。此外,本文還針對(duì)基于PROPHET-SE路由算法的擁塞控制做了較為深入的研究,并給出了一種基于歸一化混合參數(shù)的丟包策略。仿真結(jié)果表明,這種復(fù)合的丟包策略可以使消息遞交率、開(kāi)銷及時(shí)延三個(gè)性能指標(biāo)達(dá)到較優(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.

【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN915.0

【參考文獻(xiàn)】

相關(guān)期刊論文 前9條

1 夏奕;鄧廣宏;;DTN分發(fā)網(wǎng)絡(luò)中基于數(shù)據(jù)投遞概率的擁塞控制機(jī)制[J];通信學(xué)報(bào);2015年S1期

2 石樂(lè);胡愛(ài)群;;關(guān)于機(jī)會(huì)網(wǎng)絡(luò)及其信息安全的思考[J];密碼學(xué)報(bào);2015年04期

3 于振;徐敬東;張建忠;張玉;;基礎(chǔ)設(shè)施增強(qiáng)的DTN路由協(xié)議[J];通信學(xué)報(bào);2013年08期

4 張振京;金志剛;舒炎泰;;基于節(jié)點(diǎn)運(yùn)動(dòng)預(yù)測(cè)的社會(huì)性DTN高效路由[J];計(jì)算機(jī)學(xué)報(bào);2013年03期

5 朱鐵英;崔艷茹;李童;周治國(guó);張日明;;基于社會(huì)性的DTN網(wǎng)絡(luò)路由算法研究[J];計(jì)算機(jī)工程;2012年14期

6 張俊寶;羅光春;李炯;陳愛(ài)國(guó);;延遲容忍網(wǎng)絡(luò)路由協(xié)議研究[J];計(jì)算機(jī)應(yīng)用研究;2012年03期

7 王朕;王新華;隋敬麒;;機(jī)會(huì)網(wǎng)絡(luò)模擬器ONE及其擴(kuò)展研究[J];計(jì)算機(jī)應(yīng)用研究;2012年01期

8 劉期烈;潘英俊;李云;趙玲;;延遲容忍網(wǎng)絡(luò)中基于復(fù)制率的擁塞控制算法[J];北京郵電大學(xué)學(xué)報(bào);2010年04期

9 樊秀梅;單志廣;張寶賢;陳輝;;容遲網(wǎng)絡(luò)體系結(jié)構(gòu)及其關(guān)鍵技術(shù)研究[J];電子學(xué)報(bào);2008年01期

相關(guān)碩士學(xué)位論文 前1條

1 左民樂(lè);基于社會(huì)網(wǎng)絡(luò)的可容忍延遲路由算法研究[D];上海師范大學(xué);2010年

，

本文編號(hào)：1626600