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

被引:26
作者
Chen, Longbiao [1 ]
Nguyen, Thi-Mai-Trang [2 ]
Yang, Dingqi [3 ]
Nogueira, Michele [4 ]
Wang, Cheng [1 ]
Zhang, Daqing [5 ]
机构
[1] Xiamen Univ, Fujian Key Lab Sensing & Comp Smart Cities SCSC, Sch Informat, Xiamen 361005, Peoples R China
[2] Sorbonne Univ, CNRS, Lab Informat Paris LIP6 6, F-7606 Paris, France
[3] Univ Fribourg, EXascale Infolab, CH-1700 Fribourg, Switzerland
[4] Univ Fed Parana, BR-80060000 Curitiba, Parana, Brazil
[5] Inst Mines Telecom, Telecom SudParis, CNRS 5157, Paris, France
关键词
Handover; Optimization; Cellular networks; Computer architecture; Mobile computing; Base stations; Cellular network; C-RAN optimization; deep learning; big data analytics; RADIO ACCESS NETWORK; CLOUD; MODEL;
D O I
10.1109/TMC.2020.2971470
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1773 / 1788
页数:16
相关论文
共 67 条
  • [21] Cici B., 2015, Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing, P317, DOI DOI 10.1145/2746285.2746292
  • [22] Ciglan M, 2010, LECT NOTES COMPUT SC, V6488, P91, DOI 10.1007/978-3-642-17616-6_10
  • [23] Dimou K, 2009, IEEE VTS VEH TECHNOL, P1411
  • [24] Ericsson Mobility, 2018, Ericsson mobility report
  • [25] Audio environment classification for hearing aids using artificial neural networks with windowed input
    Freeman, C.
    Dony, R. D.
    Areibi, S. M.
    [J]. 2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN IMAGE AND SIGNAL PROCESSING, 2007, : 183 - 188
  • [26] Fujishige S, 2005, ANN DISCR MATH, V58, P1
  • [27] Furno A, 2017, IEEE INFOCOM SER
  • [28] Mobile Demand Profiling for Cellular Cognitive Networking
    Furno, Angelo
    Naboulsi, Diala
    Stanica, Razvan
    Fiore, Marco
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2017, 16 (03) : 772 - 786
  • [29] SET-PARTITIONING PROBLEM - SET COVERING WITH EQUALITY CONSTRAINTS
    GARFINKEL, RS
    NEMHAUSER, GL
    [J]. OPERATIONS RESEARCH, 1969, 17 (05) : 848 - +
  • [30] Graves A, 2012, STUD COMPUT INTELL, V385, P1, DOI [10.1162/neco.1997.9.1.1, 10.1007/978-3-642-24797-2]