论文标题

群集的无单元网络:图形分配方法

Clustered Cell-Free Networking: A Graph Partitioning Approach

论文作者

Wang, Junyuan, Dai, Lin, Yang, Lu, Bai, Bo

论文摘要

通过移动毫米波(MMWave)频率,将密集部署基站(BSS),以在第六代(6G)移动通信系统中提供无缝覆盖范围,不幸的是,这会导致严重的细胞边缘问题。此外,在BSS上使用的大量多输入 - 型号输出(MIMO)天线阵列,BeamSpace通道对每个用户来说都是稀疏的,因此无需在其中联合使用所有光束在单元格中为所有用户提供服务。因此,开发一种灵活的簇状细胞网络方案至关重要,该方案可以将整个网络分解为许多独立和并行操作的弱干扰的小子网。鉴于服务质量保证的每个用户速率约束,本文旨在最大化分解子网的数量,以便尽可能地降低信号传导开销和系统复杂性。通过将其制定为二手图分区问题,提出了速率受限的网络分解(RC-NETDECOMP)算法,可以通过增加所需的每用户速率来平滑地调整来自具有简单光束分配的当前蜂窝网络到完全合作的网络的网络结构。仿真结果表明,所提出的RC-NETDECOMP算法在平均每个用户速率,用户之间的公平性和能源效率方面优于现有基准。

By moving to millimeter wave (mmWave) frequencies, base stations (BSs) will be densely deployed to provide seamless coverage in sixth generation (6G) mobile communication systems, which, unfortunately, leads to severe cell-edge problem. In addition, with massive multiple-input-multiple-output (MIMO) antenna arrays employed at BSs, the beamspace channel is sparse for each user, and thus there is no need to serve all the users in a cell by all the beams therein jointly. Therefore, it is of paramount importance to develop a flexible clustered cell-free networking scheme that can decompose the whole network into a number of weakly interfered small subnetworks operating independently and in parallel. Given a per-user rate constraint for service quality guarantee, this paper aims to maximize the number of decomposed subnetworks so as to reduce the signaling overhead and system complexity as much as possible. By formulating it as a bipartite graph partitioning problem, a rate-constrained network decomposition (RC-NetDecomp) algorithm is proposed, which can smoothly tune the network structure from the current cellular network with simple beam allocation to a fully cooperative network by increasing the required per-user rate. Simulation results demonstrate that the proposed RC-NetDecomp algorithm outperforms existing baselines in terms of average per-user rate, fairness among users and energy efficiency.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源