Uplink SCMA-empowered Uncoordinated Random Access for Future mMTC
Pengyu Gao, Qu Luo, Jing Zhu, Gaojie Chen, Pei Xiao, Chuan Heng Foh

TL;DR
This paper introduces a novel uncoordinated random access protocol combining SCMA with interference cancellation and load management, significantly improving throughput for future massive machine type communication networks.
Contribution
It proposes a new SCMA-empowered URA scheme with an interference-canceling decoding strategy and adaptive load control, enhancing access efficiency without central coordination.
Findings
Achieves higher maximum throughput than conventional OMA-based URA.
Provides accurate theoretical throughput analysis.
Demonstrates effectiveness of user barring in congestion control.
Abstract
In this paper, a novel uncoordinated random access (URA) protocol is presented to address the pressing demand for massive connectivity with low access latency in future massive machine type communication (mMTC) scenarios. The proposed URA scheme integrates the classical slotted ALOHA (S-ALOHA) protocol with sparse code multiple access (SCMA) technique, referred to as SCMA-empowered URA. Specifically, active users randomly choose an SCMA codebook to access the communication network in an arbitrary time slot whenever they want without scheduling. However, due to the lack of central coordination in the proposed URA scheme, SCMA codebook collisions become inevitable, making decoding challenging and leading to increased access failures. To cope with the decoding issue, an interference-canceling (IC) first decoding strategy is proposed at the access point (AP), which can partially tackles…
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.
