异构网络中几乎空白子帧存在时干扰协调方法

针对异构网络中几乎空白子帧存在时用户接入选择和资源分配方法过于复杂的情况，以及吞吐量需求难以得到满足问题，以最大化系统总吞吐量为目标提出一种易于实现的蚁群算法.在考虑不同用户不同需求的前提下，根据微基站用户在几乎空白子帧和正常子帧时受到干扰的不同，把一个微基站划分为两个虚拟基站，将所存在的问题建模为广义分配问题进行求解，同时解决了用户接入选择和资源分配问题.仿真结果表明，所提出方法与参考文献方法及两种增强型小区干扰协调固定配置结果相比，可以有效提高系统总吞吐量，同时兼顾小区边缘用户吞吐量，实现了良好的综合性能，能够更好地满足用户需求并在实际系统中易于实现.
Since the existing algorithms of user selecting access and resource allocation algorithms are too complicated in heterogeneous networks (HetNets) with almost blank subframe (ABS), and the system throughput demand is difficult to meet, we propose ant colony optimization (ACO) algorithm that is easy to be implemented. On the premise of different demands of different users, according to the definition of ABS, it is obvious that, in ABS and n-ABS periods, the UEs associated to PBS will suffer different interference. Therefore, a PBS can be divided into two virtual PBSs and the problem can be modeled as a generalized assignment one. The user equipment (UE) assignment problem and resource allocation problem are jointly solved. Simulation results demonstrate that, compared with the algorithm proposed in the reference paper and two kinds of fixed enhanced inter-cell interference coordination (eICIC) patterns, the proposed algorithm has a quite well improvement on the total system throughput, and at the same time, while taking into account the cell edge user throughput and achieving a good overall performance, this algorithm can better meet the needs of UEs and be easy to implement in practice.