Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 21 Aug 2025 in eess.SP | (2508.15673v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.