本文選題：全雙工無線網(wǎng) + 傳輸機(jī)制��； 參考：《北京信息科技大學(xué)》2017年碩士論文

【摘要】：全雙工(Full-duplex,FD)通信技術(shù)以其吞吐容量倍增及其潛在的頻譜資源利用率提升能力得到學(xué)術(shù)界和工業(yè)界的廣泛關(guān)注。本文圍繞多跳全雙工無線網(wǎng)絡(luò)傳輸機(jī)制及性能評(píng)價(jià)展開研究。首先,本文深入分析了影響全雙工無線網(wǎng)絡(luò)容量增益的幾種因素,構(gòu)建了雙信道下全雙工無線網(wǎng)絡(luò)容量分析模型,提出了一種綜合分析框架以量化全雙工無線網(wǎng)絡(luò)網(wǎng)絡(luò)層容量增益比。得出一維雙信道全雙工無線網(wǎng)絡(luò)雙向傳輸模式下,每一流的網(wǎng)絡(luò)容量為W/(nD)?4/(2+Δ),二維雙信道全雙工無線網(wǎng)絡(luò)雙向模式的網(wǎng)絡(luò)容量上界為(2W)/(nD)?2/(2+?)?(1+?)r。其次,針對(duì)雙信道全雙工無線網(wǎng)絡(luò)提出兩種鏈路調(diào)度算法以優(yōu)化網(wǎng)絡(luò)吞吐量。一種是集中式鏈路調(diào)度算法(簡(jiǎn)稱為CLSA)。在CLSA算法中,本文把鏈路調(diào)度問題轉(zhuǎn)化為求無線網(wǎng)絡(luò)中鏈路干擾圖的最大獨(dú)立集問題。首先為多跳全雙工無線網(wǎng)絡(luò)構(gòu)建鏈路的干擾沖突圖,再運(yùn)用模擬退火算法求其最大獨(dú)立集。另一種是分布式鏈路調(diào)度算法(簡(jiǎn)稱為DLSA)。在DLSA算法中,本文考慮了異步競(jìng)爭(zhēng)并修改節(jié)點(diǎn)退避計(jì)時(shí)器的衰減機(jī)制以有效利用空閑網(wǎng)絡(luò)資源。而后,通過MATLAB仿真工具分別構(gòu)建網(wǎng)絡(luò)場(chǎng)景實(shí)現(xiàn)了兩種調(diào)度算法,并與理想的調(diào)度模式以及貪婪調(diào)度做分析對(duì)比。最后,針對(duì)多跳全雙工無線網(wǎng)絡(luò)中路由選擇與鏈路調(diào)度聯(lián)合優(yōu)化問題,運(yùn)用網(wǎng)絡(luò)流相關(guān)理論對(duì)問題建模,給出了形式化描述。鑒于此問題是NP-hard問題,本文提出了兩種路由選擇算法:MinCostRo和MinMaxRo。待所有流均選擇各自的路徑后,再使用基于CSMA思想的鏈路調(diào)度機(jī)制為所選鏈路分配時(shí)間片。對(duì)于所提算法,本文使用MATLAB做仿真實(shí)驗(yàn),并與經(jīng)典的最短路徑路由選擇算法(簡(jiǎn)稱為SPRA)和AODV-Based算法從不同角度作對(duì)比分析。實(shí)驗(yàn)結(jié)果驗(yàn)證了MinCostRo算法相比其他三種算法均有性能上的提升。MinCostRo提升系統(tǒng)吞吐量相比SPRA和AODV-Based分別是49%和33%。
[Abstract]:Full-duplex FDD (full Duplex) communication technology has attracted extensive attention from both academia and industry for its capacity doubling and potential spectral resource efficiency enhancement. This paper focuses on the transmission mechanism and performance evaluation of multihop full duplex wireless networks. Firstly, several factors affecting the capacity gain of full-duplex wireless network are analyzed, and a full-duplex wireless network capacity analysis model is constructed. A comprehensive analysis framework is proposed to quantify the capacity gain ratio of full duplex wireless network layer. It is obtained that in the bidirectional transmission mode of one-dimensional dual-channel full-duplex wireless network, each first-rate network capacity is W/(nD)?4/(2 螖, and the upper limit of network capacity of two-dimensional dual-channel full-duplex wireless network is 2W / 2 / 2 / 2 / 2 / 1 / r. Secondly, two link scheduling algorithms are proposed to optimize network throughput for dual channel full duplex wireless networks. One is a centralized link scheduling algorithm (CLSAA). In the CLSA algorithm, the link scheduling problem is transformed into the maximum independent set problem of the link interference graph in the wireless network. Firstly, the interference collision graph of multi-hop full-duplex wireless network is constructed, and then the maximum independent set is obtained by simulated annealing algorithm. The other is distributed link scheduling algorithm (DLSAN). In the DLSA algorithm, the asynchronous competition is considered and the attenuation mechanism of the node Backoff timer is modified to make efficient use of the free network resources. Then, two scheduling algorithms are implemented by constructing network scenarios with MATLAB simulation tools, and compared with ideal scheduling mode and greedy scheduling. Finally, aiming at the joint optimization problem of routing and link scheduling in multi-hop full-duplex wireless networks, the network flow correlation theory is used to model the problem, and a formal description is given. In view of the fact that this problem is a NP-hard problem, two routing algorithms: MinCostRo and MinMax Roo are proposed in this paper. After all the streams choose their own paths, a link scheduling mechanism based on CSMA is used to allocate time slices for the selected links. The proposed algorithm is simulated by MATLAB and compared with the classical shortest path routing algorithm (SPRA) and the AODV-Based algorithm from different angles. The experimental results show that the performance of the MinCostRo algorithm is 49% and 33% higher than that of the other three algorithms. MinCostRo improves the throughput of the system compared with SPRA and AODV-Based, respectively.
【學(xué)位授予單位】：北京信息科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN92

【相似文獻(xiàn)】

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

1 鄭志雄;胡愛蘭;;LPC1768的全雙工UART的軟件模擬實(shí)現(xiàn)[J];單片機(jī)與嵌入式系統(tǒng)應(yīng)用;2013年06期

2 嚴(yán)國(guó)志;曾崇;陳昌旺;;一種抗干擾性強(qiáng)的全雙工串行多機(jī)通信接口[J];適用技術(shù)市場(chǎng);2001年03期

3 張丹丹;王興;張中山;;全雙工通信關(guān)鍵技術(shù)研究[J];中國(guó)科學(xué):信息科學(xué);2014年08期

4 熊勁松;單頻全雙工移動(dòng)通信[J];現(xiàn)代通信;1997年01期

5 倪建軍;李濤;王建宇;;基于TLK2711的高速串行全雙工通信協(xié)議研究[J];電子設(shè)計(jì)工程;2013年10期

6 萬成杰;張春;林進(jìn)佳;彭琪;;一種基于IEEE802.15.4的單信道全雙工MAC協(xié)議[J];微電子學(xué)與計(jì)算機(jī);2014年01期

7 陳燕俐;Windows 2000下全雙工串口驅(qū)動(dòng)程序的開發(fā)[J];工業(yè)控制計(jì)算機(jī);2005年09期

8 李敏 ,孟臣;SA68D21 DL全雙工無線數(shù)傳報(bào)警模塊及其應(yīng)用[J];國(guó)外電子元器件;2003年07期

9 王蘭勛;王鳳先;;基于CPLD的全雙工擴(kuò)展串行口設(shè)計(jì)[J];小型微型計(jì)算機(jī)系統(tǒng);2006年01期

10 朱志清;;基于單片機(jī)AT89C51的全雙工串行口通信設(shè)計(jì)[J];機(jī)械管理開發(fā);2012年03期

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

1 林聰仁;鐘文榮;胡曉毅;;嵌入式系統(tǒng)中純軟件全雙工串行口的實(shí)現(xiàn)[A];第六屆全國(guó)計(jì)算機(jī)應(yīng)用聯(lián)合學(xué)術(shù)會(huì)議論文集[C];2002年

2 張從力;趙光;段其昌;;基于四基線制RS-485現(xiàn)場(chǎng)全雙工語音通信的設(shè)計(jì)[A];第十七屆全國(guó)測(cè)控計(jì)量?jī)x器儀表學(xué)術(shù)年會(huì)（MCMI'2007）論文集（下冊(cè)）[C];2007年

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

1 黃凱;全雙工LTE數(shù)字自干擾時(shí)頻同步技術(shù)研究與實(shí)現(xiàn)[D];電子科技大學(xué);2014年

2 李超;單頻全雙工MIMO系統(tǒng)及多用戶系統(tǒng)研究[D];西安電子科技大學(xué);2014年

3 王鵬程;高頻譜效率的全雙工通信技術(shù)研究[D];南京郵電大學(xué);2016年

4 龔家樂;全雙工蜂窩網(wǎng)絡(luò)技術(shù)研究[D];南京郵電大學(xué);2016年

5 王闖;同時(shí)同頻全雙工通信中干擾對(duì)齊算法研究[D];重慶郵電大學(xué);2016年

6 孫彥旭;LTE同頻同時(shí)全雙工系統(tǒng)自干擾抵消級(jí)聯(lián)算法研究[D];哈爾濱工業(yè)大學(xué);2015年

7 張悅;OFDM全雙工中繼抑制環(huán)路干擾的協(xié)作傳輸方案[D];西安電子科技大學(xué);2015年

8 彭康康;應(yīng)用于移動(dòng)支付的單線全雙工SWP接口電路設(shè)計(jì)[D];華中科技大學(xué);2015年

9 李璐璐;多跳全雙工無線網(wǎng)絡(luò)傳輸機(jī)制及性能評(píng)價(jià)研究[D];北京信息科技大學(xué);2017年

10 羅馨逸;全雙工通信系統(tǒng)收發(fā)前端關(guān)鍵技術(shù)研究[D];電子科技大學(xué);2013年

，

本文編號(hào)：1905595