Analysis of Computational Complexity and Power Consumption in Cloud Based Heterogeneous RAN

R. S., Subrat Kar, Dharmaraja Selvamuthu
{"title":"Analysis of Computational Complexity and Power Consumption in Cloud Based Heterogeneous RAN","authors":"R. S., Subrat Kar, Dharmaraja Selvamuthu","doi":"10.1109/NCC.2018.8600072","DOIUrl":null,"url":null,"abstract":"In the recent past, we have witnessed steep growth in mobile data consumption. To address the capacity requirements resulting from the huge growth in mobile data traffic, the mobile network operators (MNOs) are adding more base stations and allocating more spectrum layers including outdoor and indoor small cells. Since the capacity requirement of the network varies over time, the scaling up of the network may increase the energy consumption of the Radio Access Network (RAN). Hence, we need to optimize the network to reduce the overall power consumption through Cloud based models, and deployment of power-efficient radio nodes. In this paper, we analyze the network evolution towards Cloud based Radio Access Network (CRAN) for a heterogeneous set of base stations such as those with Macro RRUs, Micro RRUs and Pico radio units. We derive the computational complexity using a flexible and ‘future-proof’ power model and apply it for the network. We also compare the computation complexity for various cases of User Equipment (UE) channel conditions, different sub-components within the given base station type and provide the results. We further use the Bin-Packing algorithm to analyze the number of base station cloud servers needed for this network and the power consumption of the base station cloud. We further evaluate whether the newer cloud servers with higher CPU cores are power efficient for a given load. We observe from the simulations, that the currently available base station cloud servers have more capacity and still are more power efficient than the baseline Compute Node servers used with the earlier power model.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Twenty Fourth National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2018.8600072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the recent past, we have witnessed steep growth in mobile data consumption. To address the capacity requirements resulting from the huge growth in mobile data traffic, the mobile network operators (MNOs) are adding more base stations and allocating more spectrum layers including outdoor and indoor small cells. Since the capacity requirement of the network varies over time, the scaling up of the network may increase the energy consumption of the Radio Access Network (RAN). Hence, we need to optimize the network to reduce the overall power consumption through Cloud based models, and deployment of power-efficient radio nodes. In this paper, we analyze the network evolution towards Cloud based Radio Access Network (CRAN) for a heterogeneous set of base stations such as those with Macro RRUs, Micro RRUs and Pico radio units. We derive the computational complexity using a flexible and ‘future-proof’ power model and apply it for the network. We also compare the computation complexity for various cases of User Equipment (UE) channel conditions, different sub-components within the given base station type and provide the results. We further use the Bin-Packing algorithm to analyze the number of base station cloud servers needed for this network and the power consumption of the base station cloud. We further evaluate whether the newer cloud servers with higher CPU cores are power efficient for a given load. We observe from the simulations, that the currently available base station cloud servers have more capacity and still are more power efficient than the baseline Compute Node servers used with the earlier power model.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于云的异构RAN计算复杂度和功耗分析
最近,我们见证了移动数据消费的急剧增长。为了应对移动数据流量的巨大增长所带来的容量需求,移动网络运营商(mno)正在增加更多的基站,并分配更多的频谱层,包括室外和室内小蜂窝。由于网络的容量需求随时间而变化,网络的扩容可能会增加无线接入网(RAN)的能耗。因此,我们需要优化网络,通过基于云的模型和部署节能无线电节点来降低总体功耗。在本文中,我们分析了网络向基于云的无线接入网(CRAN)发展的异构基站集,如具有宏rru、微rru和Pico无线电单元的基站。我们使用灵活且“面向未来”的功率模型推导出计算复杂度,并将其应用于网络。我们还比较了用户设备(UE)信道条件的各种情况下的计算复杂度,给定基站类型内的不同子组件,并提供了结果。我们进一步使用Bin-Packing算法分析了该网络所需的基站云服务器数量和基站云的功耗。我们进一步评估具有更高CPU内核的新云服务器在给定负载下是否节能。我们从模拟中观察到,当前可用的基站云服务器具有更大的容量,并且仍然比使用早期功率模型的基准计算节点服务器更节能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code A Cognitive Opportunistic Fractional Frequency Reuse Scheme for OFDMA Uplinks Caching Policies for Transient Data Grouping Subarray for Robust Estimation of Direction of Arrival Universal Compression of a Piecewise Stationary Source Through Sequential Change Detection
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1