Weighted Max-Min Fairness for C-RAN Multicasting Under Limited Fronthaul Constraints

We consider downlink transmission in cloud radio access networks with multiple cochannel multicasting groups served by a group of remote radio heads (RRHs), which receive information from a base band unit via finite-capacity fronthaul links. Our aim is to jointly design RRH selection and beamforming...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2018-04, Vol.66 (4), p.1534-1548
Main Authors: Quang-Doanh Vu, Nguyen, Kien-Giang, Juntti, Markku
Format: Article
Language:English
Subjects:
Approximation
Array signal processing
Beamforming
channel uncertainties
Cloud radio access networks
Complexity
Interference
Iterative methods
Mathematical analysis
mixed integer semidefinite program
Multicast communication
Multicasting
Optical transmitters
Quality of service
Radio transmitters
robust optimization
Robustness (mathematics)
sequential convex approximation
State of the art
transmit beamforming
Upper bound
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider downlink transmission in cloud radio access networks with multiple cochannel multicasting groups served by a group of remote radio heads (RRHs), which receive information from a base band unit via finite-capacity fronthaul links. Our aim is to jointly design RRH selection and beamforming vectors such that the minimum weighted data rate among users is maximized under the constraints of maximum transmit power and fronthaul capacity at each specific RRH. The problem is intractable due to the numerical difficulties of combination and nonconvex functions. Based on a semidefinite relaxation technique, bisection search, and a branch-and-bound method, we develop an upper bound, which is also the optimal solution to the original problem if the relaxation is tight. More importantly, we propose a heuristic low-complexity iterative procedure for practical applications based on the state-of-the-art sequential convex approximation. Subsequently, we modify the proposed methods for the uncertain channel state information case. To be specific, the upper bound and its suboptimal solution are altered based on the S-lemma while the low-complexity algorithm is tailored by using two different approximations of intractable robust counterpart. The validity of the proposed methods in the region of limited fronthaul capacity is confirmed by numerical results.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2017.2786664