Code-Expanded Random Access for Machine-Type Communications
Nuno K. Pratas, Henning Thomsen, Cedomir Stefanovic, Petar Popovski

TL;DR
This paper introduces a code-expanded random access scheme for machine-type communications that significantly increases contention resources without additional system resources, supporting higher user loads efficiently.
Contribution
The paper proposes a novel code-expanded random access method that enhances contention resource availability by expanding into the code domain, enabling support for higher loads in MTC.
Findings
Supports higher user loads than current methods
Increases contention resources without extra system resources
Enables efficient support for massive MTC deployments
Abstract
The random access methods used for support of machine-type communications (MTC) in current cellular standards are derivatives of traditional framed slotted ALOHA and therefore do not support high user loads efficiently. Motivated by the random access method employed in LTE, we propose a novel approach that is able to sustain a wide random access load range, while preserving the physical layer unchanged and incurring minor changes in the medium access control layer. The proposed scheme increases the amount of available contention resources, without resorting to the increase of system resources, such as contention sub-frames and preambles. This increase is accomplished by expanding the contention space to the code domain, through the creation of random access codewords. Specifically, in the proposed scheme, users perform random access by transmitting one or none of the available LTE…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIoT Networks and Protocols · Energy Harvesting in Wireless Networks · Wireless Body Area Networks
