Algorithm for interference coordination in heterogeneous networks with almost blank subframe
CSTR:
Author:
Affiliation:

(School of Electronics and Information Engineering, Harbin Institute of Technology, Harbin 150001, China)

Clc Number:

TN929.5

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 13,2015
  • Revised:
  • Adopted:
  • Online: November 09,2016
  • Published:
Article QR Code