Scalable Active User Detection Based on Federated Learning in Cell-Free Massive MIMO System

In the context of 6G, one of the emerging and dominant services is massive ultra-reliable and low-latency communication (mURLLC). To reduce signaling overhead and access delay, mURLLC widely adopts grant-free random access (GFRA). The first step of GFRA is active user detection (AUD), which aims to accurately and promptly identify the set of active users and determine the active channels. Traditional AUD schemes are based on iterative computations for a large number of users, leading to excessive computational load and processing delay, which severely limits the system scalability in mURLLC. Considering the high reliability and near real-time requirements of mURLLC, based on the spatial extension units (SEUs)-assisted cell-free massive multiple-input multiple-output (CF-mMIMO) system, we exploit channel sparsity to propose a scalable AUD method based on federated learning (FL). Our scheme integrate the model parameters trained at various SEUs at the centralized computing unit (CPU) without data sharing, thereby enhancing the channel detection performance within each AP cluster. Simulation results demonstrate that our scheme significantly improves detection performance compared to traditional AUD methods.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Green Communications and Networking
Published
2024-11-27
DOI
https://doi.org/10.1109/tgcn.2024.3505854
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable Active User Detection Based on Federated Learning in Cell-Free Massive MIMO System

Pengcheng Zhu, Jie Wang, Jiamin Li, Dongming Wang et al.
IEEE Transactions on Green Communications and Networking
Advanced MIMO Systems Optimization
article

Scalable Active User Detection Based on Federated Learning in Cell-Free Massive MIMO System

Pengcheng Zhu, Jie Wang, Jiamin Li, Dongming Wang, Kai Jiang
article en

Abstract

In the context of 6G, one of the emerging and dominant services is massive ultra-reliable and low-latency communication (mURLLC). To reduce signaling overhead and access delay, mURLLC widely adopts grant-free random access (GFRA). The first step of GFRA is active user detection (AUD), which aims to accurately and promptly identify the set of active users and determine the active channels. Traditional AUD schemes are based on iterative computations for a large number of users, leading to excessive computational load and processing delay, which severely limits the system scalability in mURLLC. Considering the high reliability and near real-time requirements of mURLLC, based on the spatial extension units (SEUs)-assisted cell-free massive multiple-input multiple-output (CF-mMIMO) system, we exploit channel sparsity to propose a scalable AUD method based on federated learning (FL). Our scheme integrate the model parameters trained at various SEUs at the centralized computing unit (CPU) without data sharing, thereby enhancing the channel detection performance within each AP cluster. Simulation results demonstrate that our scheme significantly improves detection performance compared to traditional AUD methods.

IEEE Transactions on Green Communications and NetworkingVol. 9(3)
Southeast University (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 81%
Advanced MIMO Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.