Analysis of Different User Grouping Algorithms in a C-RAN Downlink System

Jialong Duan 1, 2 Xavier Lagrange 1, 2 Frédéric Guilloud 3, 4
1 ADOPNET - Advanced technologies for operated networks
UR1 - Université de Rennes 1, IMT Atlantique - IMT Atlantique Bretagne-Pays de la Loire, IRISA-D2 - RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES
Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
Abstract : Centralized/Cloud Radio Access Network (C-RAN) separates Baseband Units (BBUs) away from Remote Radio Heads (RRHs) and centralizes BBUs into a BBU pool. This new architecture can facilitate the cooperation between different cells. We apply zero-forcing (ZF) for joint transmission in a C- RAN downlink system. A number of User Elements (UEs) are assigned to be served into different subframes for serving. This paper proposes two user grouping algorithms denoted Global Greedy User Grouping Algorithm (GGUGA) and User Division Algorithm (UDA) to maximize the average achievable sum rate. GGUGA is a typical greedy algorithm. UDA restricts the random selection of UEs groupings into a certain region which increases the chance to make a good choice. GGUGA achieves a similar performance compared to exhaustive enumeration of all possible UEs groupings. The complexity of UDA is much less than the one of GGUGA when the number of UEs for grouping is large at the expense of a small loss in performance.
Complete list of metadatas
Contributor : Bibliothèque Télécom Bretagne <>
Submitted on : Friday, August 11, 2017 - 2:07:11 PM
Last modification on : Friday, September 13, 2019 - 9:50:55 AM



Jialong Duan, Xavier Lagrange, Frédéric Guilloud. Analysis of Different User Grouping Algorithms in a C-RAN Downlink System. ICC 2017 : IEEE International Conference on Communications, May 2017, Paris, France. pp.1 - 6, ⟨10.1109/ICC.2017.7996786⟩. ⟨hal-01574029⟩



Record views