Breaking Network Densification Limits with Distributed Cooperative Massive Access (DCMA)

2026-07-20

AI Summary

This work addresses the severe interference and performance bottlenecks caused by dense user access in large-scale networks by proposing a cooperative decoding mechanism based on a partially centralized cell-free cloud radio access network. The approach leverages shared decoding information among remote radio heads (RRHs) combined with successive interference cancellation (SIC) and introduces a merge-and-split algorithm grounded in game theory to jointly optimize user association and message routing under practical constraints, aiming to minimize the number of active RRHs. Theoretical analysis and simulations demonstrate that the proposed scheme significantly reduces outage probability and outperforms non-cooperative or SIC-free baseline systems, thereby validating its effectiveness in enhancing both system efficiency and scalability.

Abstract

In this work, we investigate the performance of the distributed cooperative massive access (DCMA) framework in large-scale network setups by incorporating stochastic geometry modeling. A partially centralized cell-free cloud-radio access (C-RAN) architecture is considered where remote radio heads (RRHs) decode transmitted messages and cooperate with each other to enhance system performance. Specifically, they can share decoded messages via feedback links, allowing receivers to cancel inter-user interference through successive interference cancellation (SIC), thus improving the decoding capabilities of the system. For such a network, we propose a novel synergetic decoding algorithm that efficiently resolves the assignment and message sharing routing for each user while accounting for practical network constraints. Furthermore, using game theory, we develop a merge-and-split algorithm with lexicographic preference to solve the problem of minimizing the RRHs utilized without compromising the performance. Simulation results show that the proposed framework significantly outperforms systems that do not implement SIC or take advantage of the cooperation between RRHs in terms of outage probability. Finally, we evaluate the performance of the proposed algorithms and validate their efficiency.

Problem

• network densification
• massive access
• inter-user interference
• cell-free C-RAN
• outage probability

Innovation

• Distributed Cooperative Massive Access
• Successive Interference Cancellation
• Stochastic Geometry
• Merge-and-Split Algorithm
• Cell-Free C-RAN