首页> 外文会议>IEEE International Conference on Cloud Networking >An Efficient Scheme for BBU-RRH Association in C-RAN Architecture for Joint Power Saving and Re-Association Optimization
【24h】

An Efficient Scheme for BBU-RRH Association in C-RAN Architecture for Joint Power Saving and Re-Association Optimization

机译:一种用于C-RAN架构中的BBU-RRH关联的高效方案,用于联合节能和重新关联优化

获取原文

摘要

A key drive towards 5G networks is the Cloud Radio Access Networks architecture (C-RAN). It consists in decoupling two main elements composing the base station: The Base Band Unit (BBU) and the Remote Radio Head (RRH), allowing for centralized processing of BBUs and efficient resource management. The BBU-RRH associations are optimized in this context, where many RRHs are associated to a single BBU when network load conditions are low. Many studies address the BBU-RRH association problem, also known as RRH clustering, for enhancing the energy efficiency. However, rare contributions seek to optimize the BBU-RRH re-association due to the dynamicity of network load conditions. In fact, frequent re-associations between BBUs and RRHs cause a serious degradation in the Quality of Service (QoS) since connected User Equipments (UEs) experience costly handovers (HOs) to different BBUs. This paper tackles such problem by proposing a hybrid algorithm that is divided into two stages: The first is based on a potential game among RRHs to associate to active BBUs, while the second is a centralized scheme, where a central controller decides of the activation/deactivation of BBUs. We compare the results to a previous centralized proposition and to a classical formulation of BBU-RRH association problem as a bin packing optimization. The results show a good tradeoff between power saving and HO rate reduction. In addition, our proposition outperforms the performances of the bin packing problem.
机译:通往5G网络的关键驱动力是云无线电接入网络架构(C-RAN)。它包括解耦组成基站的两个主要元素:基带单元(BBU)和远程无线电头(RRH),从而允许对BBU进行集中处理并进行有效的资源管理。 BBU-RRH关联在此上下文中得到了优化,其中,当网络负载条件较低时,许多RRH与单个BBU相关联。许多研究解决了BBU-RRH关联问题,也称为RRH聚类,以提高能源效率。然而,由于网络负载条件的动态性,很少有贡献试图优化BBU-RRH重新关联。实际上,由于连接的用户设备(UE)经历了向不同BBU的昂贵切换(HO),BBU和RRH之间的频繁重新关联会导致服务质量(QoS)的严重下降。本文通过提出一种混合算法来解决此问题,该算法分为两个阶段:第一阶段基于RRH之间的潜在博弈,以关联到活动BBU,而第二阶段则是一个集中式方案,由中央控制器决定激活/关闭状态。停用BBU。我们将结果与以前的集中命题进行比较,并与BBU-RRH关联问题的经典公式作为箱装优化进行比较。结果表明,在省电和降低HO速率之间取得了很好的权衡。此外,我们的建议胜过垃圾箱包装问题的表现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号