家庭基站系统中基于图论的资源分配算法研究

发布时间：2018-03-22 16:35

本文选题：家庭基站　切入点：宏基站　出处：《南京邮电大学》2017年硕士论文　论文类型：学位论文

【摘要】：随着移动通信技术的快速发展,用户对于网络质量和数据速率的要求越来越高。家庭基站的出现有效解决了宏基站在室内覆盖不足的问题,提高了数据传输速率和用户体验感知,因此,家庭基站系统的资源分配研究是目前通信领域的研究热点。本文主要对基于图论的家庭基站网络中的资源分配算法进行了研究。在家庭基站的两层网络中,以家庭基站之间的同层干扰为研究对象,重点采用图论中的极大团和簇建立家庭基站干扰模型,并提出了三种资源分配算法。本文的主要研究内容如下:(1)针对宏基站与家庭基站共享频谱资源的下行链路场景,在保证用户公平性的前提下,提出了一种基于图论极大团的两层网络的信道分配方法。该算法首先给宏基站用户分配频谱资源并保证宏基站用户满足一定的服务质量的要求;然后,在家庭基站用户满足一定服务质量的前提下,基于图论的极大团建立了家庭基站之间的干扰模型,通过加边和最大势搜索算法(MCS)计算出团的权重和团度;最后,结合图论着色的方法来最大化信道的利用率。仿真结果表明,提出的基于极大团的算法可以有效的提高系统容量,并保证了用户的公平性。(2)在OFDMA的宏基站-家庭基站网络的下行链路中,以提高系统容量为目标,提出了一种干扰受限的基于簇的家庭基站信道分配算法,该算法由三部分组成,分别是极大团的枚举、簇的形成和信道分配算法。通过极大团的枚举得到所有的簇,以簇为单位进行信道分配,受干扰较小的家庭基站在信道分配时具有优先权,且会被分配较多的资源,以提高系统吞吐量。仿真结果表明,提出的基于簇的分配算法可以有效提升系统的平均吞吐量。(3)在密集家庭基站网络的环境下对两层异构网络的资源分配算法进行了研究,针对加权的干扰图,提出了一种动态的基于簇的子载波分配算法。该算法基于用户测量报告机制构建加权干扰图,通过最大K割的簇算法求得使同层干扰最小化的不相交的簇,采用SINR最大化的启发式算法给每个簇分配子载波,针对家庭基站网络的时变特性,提出了基于熵的混合集中/分布式干扰感知的子载波分配算法。仿真结果表明,提出的算法可以有效提升系统的平均容量。
[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.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN929.5

【参考文献】