Grant-Free Random Access in Machine-Type Communication: Approaches and Challenges

December 18, 2020 Β· Declared Dead Β· πŸ› IEEE wireless communications

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jinho Choi, Jie Ding, Ngoc Phuc Le, Zhiguo Ding arXiv ID 2012.10550 Category cs.IT: Information Theory Citations 117 Venue IEEE wireless communications Last Checked 4 months ago
Abstract
Massive machine-type communication (MTC) is expected to play a key role in supporting Internet of Things (IoT) applications such as smart cities, smart factory, and connected vehicles through cellular networks. MTC is characterized by a large number of MTC devices and their sparse activities, which are difficult to be supported by conventional approaches and motivate the design of new access technologies. In particular, in the 5th generation (5G), grant-free or 2-step random access schemes are introduced for MTC to be more efficient by reducing signaling overhead. In this article, we first introduce grant-free random access and discuss how it can be modified with massive multiple-input multiple-output (MIMO) to exploit a high spatial multiplexing gain. We then explain preamble designs that can improve the performance and variations based on the notion of non-orthogonal multiple access (NOMA). Finally, design challenges of grant-free random access towards next generation cellular systems are presented.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted