本文選題：網(wǎng)絡(luò)編碼 + 分塊碼　； 參考：《南京大學(xué)》2017年碩士論文

【摘要】：近年來,隨著無線通信技術(shù)和計算機技術(shù)的發(fā)展,無線網(wǎng)絡(luò)成為當(dāng)前最為廣泛使用的互聯(lián)網(wǎng)基礎(chǔ)支撐設(shè)施之一。但由于現(xiàn)有無線網(wǎng)絡(luò)通常采用傳統(tǒng)面向有線網(wǎng)絡(luò)架構(gòu)的路由方式和存儲-轉(zhuǎn)發(fā)模式進行數(shù)據(jù)傳輸,使得無線網(wǎng)絡(luò)傳輸性能亟待提高。相比于傳統(tǒng)的路由方式,機會路由可以充分利用無線網(wǎng)絡(luò)中廣播通信的特點,從而有效的提升網(wǎng)絡(luò)的傳輸性能。但由于缺少全局控制信息,參與機會路由的節(jié)點無法知道其他節(jié)點已接收報文情況,因此不可避免地會出現(xiàn)不同節(jié)點傳輸相同報文的問題,從而浪費網(wǎng)絡(luò)資源。為此,業(yè)界提出基于網(wǎng)絡(luò)編碼的報文傳輸機制,將接收到的報文進行編碼后在再送出去,從而有效解決冗余報文問題。與此同時,網(wǎng)絡(luò)編碼還可以通過有效利用無線網(wǎng)絡(luò)中冗余的廣播信道,從而更進一步優(yōu)化網(wǎng)絡(luò)性能。但無線網(wǎng)絡(luò)中節(jié)點計算能力有限,且具有移動性(如在延遲容忍網(wǎng)絡(luò)中),因此,如何結(jié)合無線網(wǎng)絡(luò)特征,建立高效、可靠的、基于網(wǎng)絡(luò)編碼的無線網(wǎng)絡(luò)傳輸優(yōu)化機制,是目前相關(guān)技術(shù)研究的熱點問題之一。圍繞上述問題,本文利用分塊碼低復(fù)雜度、高可用性特點,對靜態(tài)無線網(wǎng)絡(luò)和延遲容忍網(wǎng)絡(luò)中基于網(wǎng)絡(luò)編碼的網(wǎng)絡(luò)傳輸性能優(yōu)化技術(shù)進行了研究,本文的主要工作包含以下兩個方向:●針對隨機線性網(wǎng)絡(luò)編碼在無線網(wǎng)絡(luò)中復(fù)雜度高、不太適用的問題,本文將分塊碼應(yīng)用到基于機會路由的靜態(tài)無線網(wǎng)絡(luò)中,采取基于前向糾錯的兩段優(yōu)化措施,設(shè)計了一個簡單但具有一些顯著特性的塊傳輸方案,并在此基礎(chǔ)上分析了目的節(jié)點傳輸矩陣的經(jīng)驗秩分布,隨后利用該分布,對該傳輸方案的性能使用線性規(guī)劃進行了優(yōu)化,并更進一步的為該線性規(guī)劃提出了一個基于比例近似的優(yōu)化方案。最后,通過模擬實驗對該塊傳輸方案的傳輸性能進行了比較和驗證�！襻槍ρ舆t容忍網(wǎng)絡(luò)中由于節(jié)點移動導(dǎo)致間斷連接的問題,借助中繼節(jié)點構(gòu)成兩跳路由,采用存儲-攜帶-轉(zhuǎn)發(fā)的方式將源節(jié)點的報文中繼給目的節(jié)點,并且利用分塊碼無率以及塊與塊之間幫助解碼的特點,在延遲容忍網(wǎng)絡(luò)中提出了一個簡單的塊傳輸方案,隨后采用M/M/1隊列模型分析了中繼節(jié)點在該傳輸方案下緩存的狀態(tài),以及目的節(jié)點的傳輸矩陣經(jīng)驗秩分布,并在此基礎(chǔ)上對端到端的傳輸延遲進行了分析和優(yōu)化,最后,我們通過實驗對該傳輸方案的性能進行了評估。
[Abstract]:In recent years, with the development of wireless communication technology and computer technology, wireless network has become one of the most widely used Internet infrastructure. However, the existing wireless networks usually use the traditional routing mode oriented to wired network architecture and storage-forward mode for data transmission, so the wireless network transmission performance needs to be improved urgently. Compared with the traditional routing mode, opportunistic routing can make full use of the characteristics of broadcast communication in wireless networks, thus effectively improve the transmission performance of the network. However, due to the lack of global control information, the nodes participating in opportunistic routing can not know that other nodes have received packets, so it is inevitable that different nodes will transmit the same packets, thus wasting network resources. In order to solve the problem of redundant packets, the network coding mechanism is proposed, which encodes the received packets and sends them out again. At the same time, network coding can further optimize network performance by utilizing redundant broadcast channels in wireless networks. However, nodes in wireless networks have limited computing power and mobility (such as in delay-tolerant networks). Therefore, how to combine the characteristics of wireless networks to establish an efficient, reliable, network-based wireless network transmission optimization mechanism, At present, it is one of the hot issues in related technology research. Based on the above problems, this paper studies the network performance optimization techniques based on network coding in static wireless networks and delay tolerant networks by using the characteristics of low complexity and high availability of block codes. The main work of this paper includes the following two directions: to solve the problem of high complexity and inapplicability of random linear network coding in wireless networks, this paper applies block codes to static wireless networks based on opportunistic routing. A simple block transmission scheme based on forward error correction is designed, and the empirical rank distribution of the destination node transmission matrix is analyzed. The performance of the transmission scheme is optimized by linear programming, and a proportional approximate optimization scheme is proposed for the linear programming. Finally, the transmission performance of the block transmission scheme is compared and verified by simulation experiments. Aiming at the problem of intermittent connection caused by node movement in delay tolerant networks, two-hop routing is constructed by means of relay nodes. In this paper, a simple block transmission scheme is proposed in the delay tolerance network by relaying the packets of the source node to the destination node by means of storage, portability and forwarding, and taking advantage of the characteristics of block code no-rate and block to block decoding, a simple block transmission scheme is proposed in the delay tolerance network. Then we analyze the buffer state of relay node under the transmission scheme and the empirical rank distribution of the destination node's transfer matrix by using the M / M / 1 queue model, and then analyze and optimize the end-to-end transmission delay on this basis. Finally, The performance of the transmission scheme is evaluated experimentally.
【學(xué)位授予單位】：南京大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TN92

【相似文獻】

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

1 耿國桐,葉卓映,吳偉陵;空時塊碼設(shè)計及譯碼研究[J];無線電工程;2003年09期

2 徐維君;樊迅;宋文濤;;分組空時塊碼系統(tǒng)中的排序最大信噪比檢測算法[J];信息技術(shù);2006年04期

3 趙傳鋼;林家儒;吳偉陵;;一種達到最優(yōu)折中的空時塊碼設(shè)計[J];北京電子科技學(xué)院學(xué)報;2005年04期

4 虞湘賓,徐大專,畢光國;低復(fù)雜度的滿速率和部分分集多天線空時塊碼及性能[J];通信學(xué)報;2005年09期

5 劉陳,鄭武,吳鎮(zhèn)揚;網(wǎng)格編碼調(diào)制空時塊碼[J];電子與信息學(xué)報;2005年07期

6 李敏;林敏;龔錚權(quán);彭潤蘭;李德祥;;空時塊碼與波束形成結(jié)合方案及性能分析[J];電子與信息學(xué)報;2008年02期

7 盧鑫,趙曙光,胡智勇;空時塊碼的信道容量分析[J];信息技術(shù);2003年07期

8 胡思鵬;周翔;王曉剛;;多維網(wǎng)格編碼與空時塊碼的級聯(lián)系統(tǒng)[J];南京工業(yè)職業(yè)技術(shù)學(xué)院學(xué)報;2006年02期

9 張曉瀛;王欣;魏急波;;分組空時塊碼系統(tǒng)中的Turbo接收技術(shù)研究[J];系統(tǒng)仿真學(xué)報;2008年01期

10 錢軼群;錢葉旺;楊綠溪;;針對相關(guān)MIMO信道的差分空時塊碼[J];應(yīng)用科學(xué)學(xué)報;2007年05期

相關(guān)會議論文 前2條

1 余江;陳英梅;李敏;;空時塊碼與波束形成結(jié)合方案及性能分析[A];中國通信學(xué)會第六屆學(xué)術(shù)年會論文集（中）[C];2009年

2 鄭杰文;王軍;李少謙;;在802．11n的空時傳輸中一種簡化復(fù)雜度檢測算法的性能[A];2006中國西部青年通信學(xué)術(shù)會議論文集[C];2006年

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

1 張燦寧;基于分塊碼的無線網(wǎng)絡(luò)傳輸性能優(yōu)化技術(shù)研究[D];南京大學(xué);2017年

，

本文編號：2039174