Minimizing Power Consumption under SINR Constraints for Cell-Free Massive MIMO in O-RAN

Vaishnavi Kasuluru, Luis Blanco, Miguel Angel Vazquez, Cristian J. Vaca-Rubio, Engin Zeydan
{"title":"Minimizing Power Consumption under SINR Constraints for Cell-Free Massive MIMO in O-RAN","authors":"Vaishnavi Kasuluru, Luis Blanco, Miguel Angel Vazquez, Cristian J. Vaca-Rubio, Engin Zeydan","doi":"arxiv-2409.04135","DOIUrl":null,"url":null,"abstract":"This paper deals with the problem of energy consumption minimization in Open\nRAN cell-free (CF) massive Multiple-Input Multiple-Output (mMIMO) systems under\nminimum per-user signal-to-noise-plus-interference ratio (SINR) constraints.\nConsidering that several access points (APs) are deployed with multiple\nantennas, and they jointly serve multiple users on the same time-frequency\nresources, we design the precoding vectors that minimize the system power\nconsumption, while preserving a minimum SINR for each user. We use a simple,\nyet representative, power consumption model, which consists of a fixed term\nthat models the power consumption due to activation of the AP and a variable\none that depends on the transmitted power. The mentioned problem boils down to\na binary-constrained quadratic optimization problem, which is strongly\nnon-convex. In order to solve this problem, we resort to a novel approach,\nwhich is based on the penalized convex-concave procedure. The proposed approach\ncan be implemented in an O-RAN cell-free mMIMO system as an xApp in the\nnear-real time RIC (RAN intelligent Controller). Numerical results show the\npotential of this approach for dealing with joint precoding optimization and AP\nselection.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":"59 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Networking and Internet Architecture","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.04135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper deals with the problem of energy consumption minimization in Open RAN cell-free (CF) massive Multiple-Input Multiple-Output (mMIMO) systems under minimum per-user signal-to-noise-plus-interference ratio (SINR) constraints. Considering that several access points (APs) are deployed with multiple antennas, and they jointly serve multiple users on the same time-frequency resources, we design the precoding vectors that minimize the system power consumption, while preserving a minimum SINR for each user. We use a simple, yet representative, power consumption model, which consists of a fixed term that models the power consumption due to activation of the AP and a variable one that depends on the transmitted power. The mentioned problem boils down to a binary-constrained quadratic optimization problem, which is strongly non-convex. In order to solve this problem, we resort to a novel approach, which is based on the penalized convex-concave procedure. The proposed approach can be implemented in an O-RAN cell-free mMIMO system as an xApp in the near-real time RIC (RAN intelligent Controller). Numerical results show the potential of this approach for dealing with joint precoding optimization and AP selection.
在 SINR 约束条件下最大限度降低 O-RAN 中无蜂窝大规模多输入多输出的功耗
考虑到多个接入点(AP)部署了多个天线,并在相同的时频资源上共同为多个用户提供服务,我们设计了最小化系统功耗的预编码向量,同时为每个用户保留了最小 SINR。我们使用了一个简单而又有代表性的功耗模型,它由一个固定项和一个可变项组成,固定项模拟 AP 激活时的功耗,可变项则取决于传输功率。上述问题可归结为二元受限二次优化问题,该问题具有强凸性。为了解决这个问题,我们采用了一种基于受惩罚凸凹过程的新方法。所提出的方法可以作为近实时 RIC(RAN 智能控制器)中的一个 xApp 在 O-RAN 无小区 mMIMO 系统中实现。数值结果表明了这种方法在处理联合预编码优化和接入点选择方面的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信