pith. sign in

arxiv: 2508.15673 · v1 · pith:QEDI2RYCnew · submitted 2025-08-21 · 📡 eess.SP

A Grant-free Coded Random Access Scheme for Near-field Communications

classification 📡 eess.SP
keywords accessnear-fieldrandomcodedcommunicationsconnectivityextremelygrant-free
0
0 comments X
read the original abstract

The industrial Internet of things (IIoT) is revolutionizing industrial processes by facilitating massive machine-type communications among countless interconnected devices. To efficiently handle the resulting large-scale and sporadic traffic, grant-free random access protocols-especially coded random access (CRA)-have emerged as scalable and reliable solutions. At the same time, advancements in wireless hardware, including extremely large-scale MIMO arrays and high-frequency communication (e.g., mmWave, Terahertz), are pushing network operations into the near-field propagation regime, allowing for dense connectivity and enhanced spatial multiplexing. This paper proposes an innovative approach that combines near-field spatial multiplexing with the interference mitigation capabilities of CRA, utilizing an extremely large aperture array at the access point. This integration improves reliability and reduces access latency, offering a robust framework for IIoT connectivity in next-generation 6G networks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.