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

Karen Boulos, K. Khawam, M. Helou, M. Ibrahim, H. Sawaya, Steven Martin
{"title":"An Efficient Scheme for BBU-RRH Association in C-RAN Architecture for Joint Power Saving and Re-Association Optimization","authors":"Karen Boulos, K. Khawam, M. Helou, M. Ibrahim, H. Sawaya, Steven Martin","doi":"10.1109/CloudNet.2018.8549295","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":436842,"journal":{"name":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 7th International Conference on Cloud Networking (CloudNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudNet.2018.8549295","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

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.
C-RAN架构中一种高效的BBU-RRH关联方案,用于联合节能和重关联优化
5G网络的关键驱动力是云无线接入网络架构(C-RAN)。它包括分离构成基站的两个主要元素:基带单元(BBU)和远程无线电头(RRH),允许集中处理BBU和有效的资源管理。在这种情况下,BBU- rrh关联被优化,当网络负载条件较低时,许多rrh关联到单个BBU。许多研究解决了BBU-RRH关联问题,也称为RRH聚类,以提高能源效率。然而,由于网络负载条件的动态性,很少有研究试图优化BBU-RRH重新关联。事实上,由于连接的用户设备(ue)需要花费高昂的代价切换到不同的bbu,因此在bbu和RRHs之间频繁的重新关联会导致服务质量(QoS)的严重下降。本文通过提出一种混合算法来解决这一问题,该算法分为两个阶段:第一阶段是基于rrh之间的潜在博弈来关联活动的bbu,第二阶段是一个集中方案,由中央控制器决定bbu的激活/停用。我们将结果与先前的集中命题和作为装箱优化的BBU-RRH关联问题的经典公式进行比较。结果表明,在节能和降低HO率之间取得了很好的平衡。此外,我们的命题优于装箱问题的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信