arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2607.04074cs.ITmath.IT
收藏

基于图的无蜂窝大规模 MIMO 网络节能聚类搜索研究

Study of Graph-Based Search for Energy-Efficient Clustering in Cell-Free Massive MIMO Networks

Centre for Telecommunications Studies, PUC-Rio(巴西天主教大学电信研究中心)

Julio Cesar Cardoso Tesolin, Rodrigo C. de Lamare

AI总结:

研究用户中心无蜂窝大规模 MIMO 网络节能聚类,用混合整数分数规划解决接入点聚类与功率分配问题,提出基于图的结构化搜索框架及算法,性能优于竞品。

摘要:

本文研究以用户为中心的无蜂窝大规模 MIMO 网络中的节能聚类,通过混合整数分数规划解决接入点聚类和功率分配问题。我们提出了一个基于图的结构化搜索的节能聚类和功率分配框架,并通过穷举搜索描述其最优解。我们还开发了基于图的最速上升(GBSA)算法,该算法结合了基于图的结构化搜索和通过分数规划的连续功率分配。所提出的 GBSA 算法在达到接近全局最优的能量效率的同时实现了线性每次迭代复杂度,优于竞争技术,并为未来网络提供了可扩展的解决方案。

英文摘要:

This paper investigates energy-efficient clustering in user-centric cell-free massive MIMO networks, addressing the access point clustering and power allocation problems via a mixed-integer fractional program. We propose a framework for energy-efficient clustering and power allocation with a graph-based structured search and describe its optimum solution via an exhaustive search. We also develop the Graph-Based Steepest Ascent (GBSA) algorithm, which combines a graph-based structured search along with continuous power allocation via fractional programming. The proposed GBSA algorithm achieves linear per-iteration complexity while reaching energy efficiency close to the global optimum, outperforming competing techniques and offering a scalable solution for future networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑