本文選題：容滯網(wǎng)絡(luò) + 節(jié)點(diǎn)擁塞程度　； 參考：《安徽大學(xué)》2017年碩士論文

【摘要】：伴隨著移動(dòng)無(wú)線通信技術(shù)的快速發(fā)展,許多新興網(wǎng)絡(luò)不斷涌現(xiàn)出來(lái),如星際網(wǎng)絡(luò)、陸地移動(dòng)Ad hoc網(wǎng)絡(luò)、軍事網(wǎng)絡(luò)、無(wú)線傳感器網(wǎng)絡(luò),它們不同于傳統(tǒng)的基于TCP/IP協(xié)議的網(wǎng)絡(luò),無(wú)端到端的路徑存在,且間歇性連接、網(wǎng)絡(luò)拓?fù)涠嘧�、長(zhǎng)的可變延遲、非對(duì)稱數(shù)據(jù)速率等。為了實(shí)現(xiàn)這類特殊的網(wǎng)絡(luò)通信,在2003年SIGCOMM國(guó)際會(huì)議上,一種新的網(wǎng)絡(luò)體系結(jié)構(gòu)被KevinFall等DTN研究者提出,稱為容滯網(wǎng)絡(luò)(DTN:Delay Tolerant Network),這種網(wǎng)絡(luò)體系結(jié)構(gòu)是在傳統(tǒng)的網(wǎng)絡(luò)層與應(yīng)用層之間加了一層聚束層(Bundle層),通過(guò)此層中的"存儲(chǔ)-攜帶-轉(zhuǎn)發(fā)"方式來(lái)完成報(bào)文的轉(zhuǎn)發(fā)以實(shí)現(xiàn)最終遞交。DTN中的路由算法主要有兩類,一類為單拷貝路由算法,另外一類為多拷貝路由算法。多拷貝路由算法主要是通過(guò)增加報(bào)文的副本數(shù)目來(lái)實(shí)現(xiàn)的,即允許同一報(bào)文被多次復(fù)制轉(zhuǎn)發(fā)給中繼節(jié)點(diǎn),通過(guò)多條路徑最終遞交到信宿節(jié)點(diǎn)。在遞交率方面多拷貝路由比單拷貝路由要高且路由算法研究的重點(diǎn)也在多拷貝路由算法上,因此在受限的網(wǎng)絡(luò)環(huán)境下,有效的多拷貝路由算法具有重要意義。本文的主要工作如下:1.首先,概率路由算法是一種基于歷史信息和可傳遞概率的路由算法,選擇與信宿節(jié)點(diǎn)相遇概率高的節(jié)點(diǎn)作為中繼節(jié)點(diǎn),但未考慮歷史相遇時(shí)每次的連接時(shí)間,如果歷史相遇概率高但每次連接時(shí)間較短,也有可能導(dǎo)致報(bào)文無(wú)法順利遞交過(guò)去。因此本文提出了新的遞交預(yù)期值,即考慮了相遇的概率,又增加了每次相遇時(shí)的連接時(shí)間。其次,當(dāng)中繼節(jié)點(diǎn)到信宿節(jié)點(diǎn)的相遇概率大于當(dāng)前節(jié)點(diǎn)到信宿節(jié)點(diǎn)的相遇概率時(shí),報(bào)文遞交給中繼節(jié)點(diǎn),但此時(shí)并未考慮中繼節(jié)點(diǎn)的擁塞程度,當(dāng)中繼節(jié)點(diǎn)擁塞時(shí),即使中繼節(jié)點(diǎn)到信宿節(jié)點(diǎn)的相遇概率大,中繼節(jié)點(diǎn)接收?qǐng)?bào)文也有可能導(dǎo)致更大的擁塞發(fā)生或者直接將接收的報(bào)文丟棄。因此本文提出了節(jié)點(diǎn)擁塞程度的概念,增加了轉(zhuǎn)發(fā)時(shí)對(duì)中繼節(jié)點(diǎn)擁塞程度的判斷。綜合了新的遞交預(yù)期值和中繼節(jié)點(diǎn)擁塞程度判斷,提出了一種改進(jìn)的基于節(jié)點(diǎn)擁塞程度的概率路由算法,改善了報(bào)文的遞交率和平均延遲等網(wǎng)絡(luò)性能。2.本文在基于節(jié)點(diǎn)擁塞程度的概率路由算法基礎(chǔ)上,增加了相應(yīng)的擁塞檢測(cè)機(jī)制和擁塞控制機(jī)制;當(dāng)轉(zhuǎn)發(fā)報(bào)文給中繼節(jié)點(diǎn)時(shí),優(yōu)先依次轉(zhuǎn)發(fā)丟棄策略因子D值較大的報(bào)文,當(dāng)中繼節(jié)點(diǎn)擁塞時(shí),優(yōu)先依次丟棄轉(zhuǎn)發(fā)策略因子D值較小的報(bào)文,直到為新報(bào)文騰出足夠的緩存空間。與未加入擁塞控制的基于節(jié)點(diǎn)擁塞程度的概率路由算法相比,提高了報(bào)文的遞交率和降低了網(wǎng)絡(luò)的開(kāi)銷率。3.本文使用The ONE仿真軟件對(duì)所提出的一種改進(jìn)的基于節(jié)點(diǎn)擁塞程度的概率路由算法及擁塞控制策略分別進(jìn)行了仿真驗(yàn)證,并與其它的路由算法進(jìn)行比較分析。
[Abstract]:With the rapid development of mobile wireless communication technology, many new networks are emerging, such as interstellar networks, terrestrial mobile Ad hoc networks, military networks, wireless sensor networks, which are different from the traditional networks based on TCP/IP protocol. End-to-end paths exist with intermittent connections, network topologies vary, long variable delays, asymmetric data rates, and so on. In order to realize this kind of special network communication, at the 2003 SIGCOMM International Conference, a new network architecture was proposed by DTN researchers such as KevinFall. Called DTN: delay Tolerant Network, this network architecture is to add a bundle layer between the traditional network layer and the application layer. In this layer, the "storage-carry-forward" mode is used to complete the forwarding of messages. There are two kinds of routing algorithms in the final delivery. DTN. One is a single copy routing algorithm, the other is a multi-copy routing algorithm. Multi-copy routing algorithm is mainly implemented by increasing the number of copies of the message, that is to say, the same message is allowed to be copied and forwarded to the relay node many times, and finally submitted to the host node through multiple paths. In the aspect of delivery rate, multi-copy routing is higher than single-copy routing, and the research focus of routing algorithm is also on multi-copy routing algorithm. Therefore, in restricted network environment, effective multi-copy routing algorithm is of great significance. The main work of this paper is as follows: 1. Firstly, the probabilistic routing algorithm is a routing algorithm based on historical information and transferable probability. The node with high probability of meeting with the host node is chosen as the relay node, but the connection time of each time when the historical encounter is not considered. If the probability of historical encounter is high but the time of each connection is short, it may also lead to the failure to submit the message smoothly. In this paper, a new expected value is proposed, that is, the probability of meeting is considered, and the connection time of each encounter is increased. Secondly, when the encounter probability between the relay node and the host node is greater than that between the current node and the host node, the message is submitted to the relay node, but the degree of congestion of the relay node is not considered at this time, when the relay node is congested, Even if the encounter probability between relay node and host node is high, the receiving message of relay node may lead to more congestion or discard the received message directly. Therefore, the concept of node congestion degree is proposed in this paper, which increases the judgment of relay node congestion degree when forwarding. A new probabilistic routing algorithm based on node congestion degree is proposed to improve the network performance of packet delivery rate and average delay. Based on the probabilistic routing algorithm based on node congestion degree, this paper adds the corresponding congestion detection mechanism and congestion control mechanism. When the relay node is congested, the packets with a smaller forwarding policy factor D are discarded first and then until sufficient buffer space is made available for the new message. Compared with the probabilistic routing algorithm based on the degree of congestion without congestion control, the packet delivery rate and the overhead rate of the network are improved. In this paper, an improved probabilistic routing algorithm based on node congestion degree and congestion control strategy are simulated and verified by using The ONE simulation software, and compared with other routing algorithms.
【學(xué)位授予單位】：安徽大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN915.0

【相似文獻(xiàn)】

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

1 吳大鵬;孔曉龍;王汝言;靳繼偉;樊思龍;;節(jié)點(diǎn)重要程度感知的分布式DTN結(jié)構(gòu)檢測(cè)機(jī)制[J];計(jì)算機(jī)應(yīng)用研究;2012年07期

2 苗苗;;英飛朗DTN獲得工業(yè)和信息化部進(jìn)網(wǎng)許可證[J];郵電設(shè)計(jì)技術(shù);2008年06期

3 成潔;盧紫毅;林青;;延時(shí)中斷容忍網(wǎng)絡(luò)(DTN)捆綁層協(xié)議研究[J];軍事通信技術(shù);2011年01期

4 倪辰辰;李千目;姜怡;查玄閱;;基于輕型機(jī)步野戰(zhàn)場(chǎng)景的DTN通信策略設(shè)計(jì)與性能分析[J];電信科學(xué);2013年10期

5 劉飛;謝永明;王國(guó)軍;;DTN中基于馬爾科夫鏈的聲譽(yù)評(píng)估策略[J];計(jì)算機(jī)工程;2012年23期

6 張迪;王貴竹;;DTN中概率選擇的散發(fā)等待路由[J];通信技術(shù);2010年05期

7 郭航;王興偉;黃敏;蔣定德;;基于多隊(duì)列自適應(yīng)的DTN傳染路由算法[J];小型微型計(jì)算機(jī)系統(tǒng);2012年04期

8 王貴竹;徐正歡;李曉峰;;DTN中依據(jù)報(bào)文質(zhì)量的擁塞控制策略[J];計(jì)算機(jī)工程與應(yīng)用;2012年09期

9 彭敏;洪佩琳;薛開(kāi)平;盧漢成;;基于投遞概率預(yù)測(cè)的DTN高效路由[J];計(jì)算機(jī)學(xué)報(bào);2011年01期

10 薛靜鋒;范志安;李建勝;樊秀梅;;基于歷史信息預(yù)測(cè)轉(zhuǎn)發(fā)概率的DTN路由算法[J];北京理工大學(xué)學(xué)報(bào);2011年01期

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

1 董春陽(yáng);基于機(jī)器學(xué)習(xí)的車載自組織網(wǎng)絡(luò)DTN路由協(xié)議研究[D];重慶郵電大學(xué);2016年

2 鐘智翔;基于動(dòng)態(tài)多跳鏈路的空間DTN數(shù)據(jù)單元參數(shù)優(yōu)化[D];哈爾濱工業(yè)大學(xué);2015年

3 黃天雨;基于分塊聚合的深空DTN傳輸策略優(yōu)化設(shè)計(jì)[D];哈爾濱工業(yè)大學(xué);2015年

4 陶健;DTN中基于擁塞程度的概率路由研究[D];安徽大學(xué);2017年

5 韓薈;DTN彈性質(zhì)量自適應(yīng)架構(gòu)研究[D];南京理工大學(xué);2011年

6 卓琳琳;DTN網(wǎng)絡(luò)可靠傳輸機(jī)制研究[D];西安電子科技大學(xué);2014年

7 劉劍華;空天DTN網(wǎng)絡(luò)傳輸控制問(wèn)題研究[D];華中科技大學(xué);2009年

8 曹丞瑋;高鐵通信中DTN路由協(xié)議的研究[D];蘇州大學(xué);2014年

9 薛超;基于社會(huì)網(wǎng)絡(luò)分析的DTN路由算法[D];西安電子科技大學(xué);2011年

10 馬蓓蕾;DTN中基于緩沖區(qū)占用率和轉(zhuǎn)發(fā)率的路由研究[D];安徽大學(xué);2015年

，

本文編號(hào)：1914817