Clustered Cell-Free Networking: A Graph Partitioning Approach

TL;DR

This paper introduces a graph partitioning method called RC-NetDecomp to decompose 6G millimeter wave networks into small, weakly interfered subnetworks, reducing complexity while maintaining service quality.

Contribution

It proposes a novel bipartite graph partitioning algorithm for flexible network decomposition based on per-user rate constraints, enhancing network efficiency and scalability.

Findings

Outperforms existing methods in average per-user rate

Improves fairness among users

Enhances energy efficiency

Abstract

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.