Joint remote radio head selection and user association in cloud radio access networks

Aini Li, Y. Sun, Xiaodong Xu, Chunjing Yuan
{"title":"Joint remote radio head selection and user association in cloud radio access networks","authors":"Aini Li, Y. Sun, Xiaodong Xu, Chunjing Yuan","doi":"10.1109/PIMRC.2016.7794613","DOIUrl":null,"url":null,"abstract":"The cloud radio access network (C-RAN) has been proposed recently as a promising network architecture to meet the explosive data traffic growth in 5G wireless communication systems. In C-RAN, all baseband signal processing is centralized at one Baseband Unit (BBU) pool powered by cloud computing technologies. Whilst the Remote Radio Heads (RRHs), left off on the cell sites, are connected to the BBU pool through fronthaul networks and can be densely deployed with low cost. However, a large number of active RRHs located close to each other may result in severer interference and inefficient energy consumption. To tackle above challenges, we formulate a network power consumption minimization (NPCM) problem, which selects a set of active RRHs and constructs the user association with the active RRHs. The capacity limitation of the fronthaul network is considered in the problem. Since the NPCM problem belongs to the integer programming problem and is NP-hard, we propose a low complexity approximation algorithm that yields the performance guarantees: joint RRH selection and user association (JRSUA) algorithm. A simulation platform is developed to evaluate the network power consumption in three fronthaul network scenarios: fiber, wireless and mixed. Simulation results show that the proposed JRSUA algorithm is able to provide near-optimal performance with reduced complexity and outperforms the other counterparts.","PeriodicalId":137845,"journal":{"name":"2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"278 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2016.7794613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The cloud radio access network (C-RAN) has been proposed recently as a promising network architecture to meet the explosive data traffic growth in 5G wireless communication systems. In C-RAN, all baseband signal processing is centralized at one Baseband Unit (BBU) pool powered by cloud computing technologies. Whilst the Remote Radio Heads (RRHs), left off on the cell sites, are connected to the BBU pool through fronthaul networks and can be densely deployed with low cost. However, a large number of active RRHs located close to each other may result in severer interference and inefficient energy consumption. To tackle above challenges, we formulate a network power consumption minimization (NPCM) problem, which selects a set of active RRHs and constructs the user association with the active RRHs. The capacity limitation of the fronthaul network is considered in the problem. Since the NPCM problem belongs to the integer programming problem and is NP-hard, we propose a low complexity approximation algorithm that yields the performance guarantees: joint RRH selection and user association (JRSUA) algorithm. A simulation platform is developed to evaluate the network power consumption in three fronthaul network scenarios: fiber, wireless and mixed. Simulation results show that the proposed JRSUA algorithm is able to provide near-optimal performance with reduced complexity and outperforms the other counterparts.
云无线接入网中联合远程无线电头选择与用户关联
最近,云无线接入网(C-RAN)作为一种有前途的网络架构被提出,以满足5G无线通信系统中数据流量的爆炸式增长。在C-RAN中,所有基带信号处理都集中在一个基于云计算技术的基带单元(BBU)池中。而远程无线电头(RRHs),留在小区站点上,通过前传网络连接到BBU池,可以以低成本密集部署。然而,大量相互靠近的有源RRHs可能会造成严重的干扰和低效的能量消耗。为了解决上述问题,我们提出了一个网络功耗最小化(NPCM)问题,该问题选择一组主动RRHs,并与主动RRHs构建用户关联。该问题考虑了前传网络的容量限制。由于NPCM问题属于整数规划问题,并且是np困难的,我们提出了一种低复杂度的近似算法:联合RRH选择和用户关联(JRSUA)算法。建立了一个仿真平台,对光纤、无线和混合三种前传网络场景下的网络功耗进行了评估。仿真结果表明,所提出的JRSUA算法能够在降低复杂度的同时提供接近最优的性能,并优于其他同类算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信