4.7 Article

Data-Driven C-RAN Optimization Exploiting Traffic and Mobility Dynamics of Mobile Users

Journal

IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 20, Issue 5, Pages 1773-1788

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2020.2971470

Keywords

Handover; Optimization; Cellular networks; Computer architecture; Mobile computing; Base stations; Cellular network; C-RAN optimization; deep learning; big data analytics

Funding

  1. NSF of China [61802325]
  2. NSF of Fujian Province [2018J01105]
  3. China Fundamental Research Funds for the Central Universities [20720170040]

Ask authors/readers for more resources

The paper proposes a data-driven framework for C-RAN optimization, which includes a deep-learning-based MuLSTM model to capture the spatiotemporal patterns of traffic and mobility, and a RCLP algorithm to solve the RRH-BBU mapping problem with cost and quality objectives. The evaluations with real-world datasets show that the proposed framework outperforms traditional and state-of-the-art baselines in BBU utilization and handling mobility events with high quality.
The surging traffic volumes and dynamic user mobility patterns pose great challenges for cellular network operators to reduce operational costs and ensure service quality. Cloud-radio access network (C-RAN) aims to address these issues by handling traffic and mobility in a centralized manner, separating baseband units (BBUs) from base stations (RRHs) and sharing BBUs in a pool. The key problem in C-RAN optimization is to dynamically allocate BBUs and map them to RRHs under cost and quality constraints, since real-world traffic and mobility are difficult to predict, and there are enormous numbers of candidate RRH-BBU mapping schemes. In this work, we propose a data-driven framework for C-RAN optimization. First, we propose a deep-learning-based Multivariate long short term memory (MuLSTM) model to capture the spatiotemporal patterns of traffic and mobility for accurate prediction. Second, we formulate RRH-BBU mapping with cost and quality objectives as a set partitioning problem, and propose a resource-constrained label-propagation (RCLP) algorithm to solve it. We show that the greedy RCLP algorithm is monotone suboptimal with worst-case approximation guarantee to optimal. Evaluations with real-world datasets from Ivory Coast and Senegal show that our framework achieves a BBU utilization above 85.2 percent, with over 82.3 percent of mobility events handled with high quality, outperforming the traditional and the state-of-the-art baselines.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available