發(fā)布時間：2018-03-22 16:35

  本文選題：家庭基站　切入點：宏基站　出處：《南京郵電大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著移動通信技術(shù)的快速發(fā)展,用戶對于網(wǎng)絡(luò)質(zhì)量和數(shù)據(jù)速率的要求越來越高。家庭基站的出現(xiàn)有效解決了宏基站在室內(nèi)覆蓋不足的問題,提高了數(shù)據(jù)傳輸速率和用戶體驗感知,因此,家庭基站系統(tǒng)的資源分配研究是目前通信領(lǐng)域的研究熱點。本文主要對基于圖論的家庭基站網(wǎng)絡(luò)中的資源分配算法進行了研究。在家庭基站的兩層網(wǎng)絡(luò)中,以家庭基站之間的同層干擾為研究對象,重點采用圖論中的極大團和簇建立家庭基站干擾模型,并提出了三種資源分配算法。本文的主要研究內(nèi)容如下:(1)針對宏基站與家庭基站共享頻譜資源的下行鏈路場景,在保證用戶公平性的前提下,提出了一種基于圖論極大團的兩層網(wǎng)絡(luò)的信道分配方法。該算法首先給宏基站用戶分配頻譜資源并保證宏基站用戶滿足一定的服務(wù)質(zhì)量的要求;然后,在家庭基站用戶滿足一定服務(wù)質(zhì)量的前提下,基于圖論的極大團建立了家庭基站之間的干擾模型,通過加邊和最大勢搜索算法(MCS)計算出團的權(quán)重和團度;最后,結(jié)合圖論著色的方法來最大化信道的利用率。仿真結(jié)果表明,提出的基于極大團的算法可以有效的提高系統(tǒng)容量,并保證了用戶的公平性。(2)在OFDMA的宏基站-家庭基站網(wǎng)絡(luò)的下行鏈路中,以提高系統(tǒng)容量為目標(biāo),提出了一種干擾受限的基于簇的家庭基站信道分配算法,該算法由三部分組成,分別是極大團的枚舉、簇的形成和信道分配算法。通過極大團的枚舉得到所有的簇,以簇為單位進行信道分配,受干擾較小的家庭基站在信道分配時具有優(yōu)先權(quán),且會被分配較多的資源,以提高系統(tǒng)吞吐量。仿真結(jié)果表明,提出的基于簇的分配算法可以有效提升系統(tǒng)的平均吞吐量。(3)在密集家庭基站網(wǎng)絡(luò)的環(huán)境下對兩層異構(gòu)網(wǎng)絡(luò)的資源分配算法進行了研究,針對加權(quán)的干擾圖,提出了一種動態(tài)的基于簇的子載波分配算法。該算法基于用戶測量報告機制構(gòu)建加權(quán)干擾圖,通過最大K割的簇算法求得使同層干擾最小化的不相交的簇,采用SINR最大化的啟發(fā)式算法給每個簇分配子載波,針對家庭基站網(wǎng)絡(luò)的時變特性,提出了基于熵的混合集中/分布式干擾感知的子載波分配算法。仿真結(jié)果表明,提出的算法可以有效提升系統(tǒng)的平均容量。
[Abstract]:With the rapid development of mobile communication technology, the demand of users for network quality and data rate is becoming higher and higher. The emergence of home base station effectively solves the problem of inadequate indoor coverage of Acer station. Improved data transfer rate and user experience awareness, therefore, The research on the resource allocation of the family base station system is a hot topic in the field of communication at present. This paper mainly studies the resource allocation algorithm in the family base station network based on graph theory. Taking the same layer interference between the family base stations as the research object, the interference model of the family base station is established by using the maximal clusters and clusters in the graph theory. Three resource allocation algorithms are proposed. The main contents of this paper are as follows: 1) aiming at the downlink scenario where the Acer station and the home base station share the spectrum resources, and on the premise of ensuring the fairness of the user, the main contents of this paper are as follows: 1. In this paper, a channel allocation method for two-layer network based on graph theory maximization is proposed. Firstly, the algorithm assigns spectrum resources to the users of Acer stations and ensures that the users of Acer stations meet the requirements of quality of service (QoS). On the premise that the users of the home base station satisfy the certain quality of service, the interference model between the base stations of the family is established based on graph theory, and the weight and the degree of the group are calculated by the edge addition and the maximum potential search algorithm (MCSs). Finally, The simulation results show that the proposed algorithm can effectively improve the system capacity. In order to improve the system capacity, a cluster-based channel assignment algorithm based on interference limitation is proposed in the downlink of OFDMA's macro base station-home base station network. The algorithm is composed of three parts. They are enumeration of maximal clusters, formation of clusters and channel assignment algorithms. All clusters are obtained by enumeration of maximal clusters, and channel assignment is carried out in units of clusters. The home base stations with less interference have priority in channel assignment. And will be allocated more resources to improve the system throughput. Simulation results show that, The proposed cluster-based allocation algorithm can effectively enhance the average throughput of the system. In the environment of dense home base station network, the resource allocation algorithm of two-layer heterogeneous network is studied, and the weighted interference graph is used to solve the problem. A dynamic cluster-based subcarrier allocation algorithm is proposed, which is based on the user measurement report mechanism to construct a weighted interference graph. The disjoint clusters that minimize the interference in the same layer are obtained by the maximum K-cut cluster algorithm. The SINR maximization heuristic algorithm is used to allocate subcarriers to each cluster. Considering the time-varying characteristics of the cell base station network, an entropy based hybrid centralized / distributed interference sensing subcarrier allocation algorithm is proposed. The simulation results show that, The proposed algorithm can effectively increase the average capacity of the system.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TN929.5

【參考文獻】

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

1 Hao Zhang;Hongyan Li;Jung Hoon Lee;;Efficient Subchannel Allocation Based on Clustered Interference Alignment in Ultra-Dense Femtocell Networks[J];中國通信;2017年04期

2 邵一敏;申奇;;Femtocell技術(shù)的由來、優(yōu)勢和市場前景[J];郵電設(shè)計技術(shù);2010年12期

，

本文編號：1649478