Joint Load Balancing and Interference Management for Small-Cell Heterogeneous Networks With Limited Backhaul Capacity

被引:106
作者
Ho Huu Minh Tam [1 ]
Hoang Duong Tuan [1 ]
Duy Trong Ngo [2 ]
Duong, Trung Q. [3 ]
Poor, H. Vincent [4 ]
机构
[1] Univ Technol Sydney, Fac Engn & Informat Technol, Ultimo, NSW 2007, Australia
[2] Univ Newcastle, Sch Elect Engn & Comp, Callaghan, NSW 2308, Australia
[3] Queens Univ Belfast, Sch Elect Elect Engn & Comp Sci, Belfast BT7 1NN, Antrim, North Ireland
[4] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会; 澳大利亚研究理事会;
关键词
Combinatorial optimization; heterogeneous network; limited backhaul; load balancing; power allocation; successive convex programming; BASE STATION ASSOCIATION; RESOURCE-ALLOCATION; WIRELESS NETWORKS; POWER ALLOCATION; USER ASSOCIATION; COORDINATION; OPTIMIZATION; ALGORITHM; EVOLUTION; HETNETS;
D O I
10.1109/TWC.2016.2633262
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, new strategies are devised for joint load balancing and interference management in the downlink of a heterogeneous network, where small cells are densely deployed within the coverage area of a traditional macrocell. Unlike existing work, the limited backhaul capacity at each base station (BS) is taken into account. Here, users (UEs) cannot be offloaded to any arbitrary BS, but only to ones with sufficient backhaul capacity remaining. Jointly designed with traffic offload, transmit power allocation mitigates the intercell interference to further support the quality of service of each UE. The objective here is either: 1) to maximize the network sum rate subject to minimum throughput requirements at individual UEs, or 2) to maximize the minimum UE throughput. Both formulated problems belong to the difficult class of mixed-integer nonconvex optimization problems. The inherently binary BS-UE association variables are strongly coupled with the transmit power variables, making the problems even more challenging to solve. New iterative algorithms are developed based on an exact penalty method combined with successive convex programming, where the binary BS-UE association problem and the nonconvex power allocation problem are dealt with one at a time. At each iteration of the proposed algorithms, only two simple convex problems need to be solved at the same time scale. It is proven that the algorithms improve the objective functions at each iteration and converge eventually. Numerical results demonstrate the efficiency of the proposed algorithms in both traffic offloading and interference mitigation.
引用
收藏
页码:872 / 884
页数:13
相关论文
共 40 条
  • [1] AN OVERVIEW OF LOAD BALANCING IN HETNETS: OLD MYTHS AND OPEN PROBLEMS
    Andrews, Jeffrey G.
    Singh, Sarabjot
    Ye, Qiaoyang
    Lin, Xingqin
    Dhillon, Harpreet S.
    [J]. IEEE WIRELESS COMMUNICATIONS, 2014, 21 (02) : 18 - 25
  • [2] Seven Ways that HetNets Are a Cellular Paradigm Shift
    Andrews, Jeffrey G.
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2013, 51 (03) : 136 - 144
  • [3] [Anonymous], 1999, Athena scientific Belmont
  • [4] [Anonymous], 2012, Proc. IEEE Veh. Technol. Conf. (VTC Spring)
  • [5] [Anonymous], 2010, TR 36.814
  • [6] Backhaul-Aware User Association in FiWi Enhanced LTE-A Heterogeneous Networks
    Beyranvand, Hamzeh
    Lim, Wansu
    Maier, Martin
    Verikoukis, Christos
    Salehi, Jawad A.
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2015, 14 (06) : 2992 - 3003
  • [7] Bonnans JF, 2006, NUMERICAL OPTIMIZATI, V2nd, DOI 10.1007/978-3-662-05078-1
  • [8] Unified and Distributed QoS-Driven Cell Association Algorithms in Heterogeneous Networks
    Boostanimehr, Hamidreza
    Bhargava, Vijay K.
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2015, 14 (03) : 1650 - 1662
  • [9] Joint Optimization of Cooperative Beamforming and Relay Assignment in Multi-User Wireless Relay Networks
    Che, Enlong
    Hoang Duong Tuan
    Nguyen, Ha H.
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (10) : 5481 - 5495
  • [10] Chitti K, 2013, IEEE INT WORK SIGN P, P6, DOI 10.1109/SPAWC.2013.6612001