本文選題：異構(gòu)網(wǎng)絡(luò)　切入點：干擾對齊　出處：《西安電子科技大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著無線網(wǎng)絡(luò)的迅速發(fā)展,異構(gòu)網(wǎng)絡(luò)已經(jīng)成為了現(xiàn)在通信網(wǎng)絡(luò)的一個重要趨勢,但是異構(gòu)網(wǎng)絡(luò)帶來優(yōu)勢的同時,也有它本身需要解決的問題,其中干擾問題是需要解決的。目前為止,已經(jīng)有很多關(guān)于異構(gòu)無線網(wǎng)絡(luò)干擾方面的文章,其中干擾對齊技術(shù)是一個重要的研究方向。論文首先對范德蒙德-子空間頻分多址(VFDM)技術(shù)做了幾點改進。論文通過使用范德蒙德-子空間頻分多址技術(shù)將小基站對宏基站產(chǎn)生的干擾消除,又使用一種含有擴展群分方法的干擾對齊策略將小基站間的干擾對齊到更小的維度,通過使用這種群分方法降低了所需接收天線的數(shù)量。最后,論文推導(dǎo)出了該算法能夠?qū)崿F(xiàn)的用戶自由度,并進行了算法的仿真實現(xiàn)。論文接著在一種異構(gòu)無線網(wǎng)絡(luò)上進行了機會調(diào)度的改進。該網(wǎng)絡(luò)包含一個宏基站和任意多個小基站,其中小基站中的用戶數(shù)量也是任意的。論文使用前人提出的弦距最小準則,實現(xiàn)了宏用戶的次最優(yōu)調(diào)度。該用戶調(diào)度算法能夠在系統(tǒng)總速率損失不明顯的基礎(chǔ)上,大大降低計算的復(fù)雜度。最后論文對算法進行了仿真,并且跟窮舉算法進行了對比分析。
[Abstract]:With the rapid development of wireless network, heterogeneous network has become an important trend of communication network, but the heterogeneity network brings advantages, but also has its own problems to be solved. The interference problem needs to be solved. Up to now, there have been a lot of articles about interference in heterogeneous wireless networks. The interference alignment technique is an important research direction. Firstly, several improvements are made to VFDM technology. The small base station is realized by using Vandermond-subspace frequency division multiple access (VFDM) technology. Elimination of interference to Acer station, An interference alignment strategy with extended group subdivision is also used to align interference between small base stations to smaller dimensions, which reduces the number of receiving antennas required. This paper deduces the user degree of freedom that the algorithm can realize, and carries on the simulation realization of the algorithm. Then, the paper improves the opportunity scheduling in a heterogeneous wireless network. The network consists of a macro base station and any number of small base stations. The number of users in the small base station is arbitrary. The suboptimal scheduling of macro users is realized by using the minimum chord distance criterion proposed by the previous authors. The user scheduling algorithm can be used on the basis that the total rate loss of the system is not obvious. The computational complexity is greatly reduced. Finally, the algorithm is simulated and compared with the exhaustive algorithm.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TN929.5;TN972

【相似文獻】

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

1 陳慶章;組建異構(gòu)網(wǎng)應(yīng)著重考慮的問題和產(chǎn)品現(xiàn)狀[J];計算機時代;1994年03期

2 汪蕓,顧冠群,謝俊清,兌繼英,孫昌平;異構(gòu)網(wǎng)絡(luò)集成方法研究[J];計算機研究與發(fā)展;1997年03期

3 馬義忠;楊紅旗;高彥;専秋峰;;基于移動Agent異構(gòu)網(wǎng)絡(luò)管理的分析與設(shè)計[J];微計算機信息;2008年33期

4 黃川;鄭寶玉;;多無線電協(xié)作技術(shù)與異構(gòu)網(wǎng)絡(luò)融合[J];中興通訊技術(shù);2008年03期

5 吳蒙;季麗娜;王X;;無線異構(gòu)網(wǎng)絡(luò)的關(guān)鍵安全技術(shù)[J];中興通訊技術(shù);2008年03期

6 李R，

本文編號：1594774