Unsourced Random Access
Preprint
Abstract
Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transfers and video streaming. However, these networks are increasingly inadequate for the emerging era of machine-type communications (MTC). With a vast number of devices exhibiting sporadic traffic patterns consisting of short packets, the grant-based multiple access procedures utilized by existing networks lead to significant delays and inefficiencies. To address this issue the unsourced random access (URA) paradigm has been proposed. This paradigm assumes the devices to share a common encoder thus simplifying the reception process by eliminating the identification procedure. The URA paradigm not only addresses the computational challenges but it also considers the random access (RA) as a coding problem, i.e., takes into account both medium access protocols and physical layer effects. In this monograph we provide a comprehensive overview of the URA problem in noisy channels, with the main task being to explain the major ideas rather than to list all existing solutions.Keywords
All Related Versions
This publication has 74 references indexed in Scilit:
- MMSE‐based version of OMP for recovery of discrete‐valued sparse signalsElectronics Letters, 2016
- The Handbook of Personal Area Networking Technologies and Protocols2013
- The Convex Geometry of Linear Inverse ProblemsFoundations of Computational Mathematics, 2012
- Modern Coding Theory2008
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- List Decoding of Error-Correcting Codes2005
- Binary B2-Sequences : A New Upper BoundJournal of Combinatorial Theory, Series A, 2001
- Forward collision resolution-a technique for random multiple-access to the adder channelIEEE Transactions on Information Theory, 1993
- On B2-sequences of vectorsJournal of Number Theory, 1972
- Determination of two vectors from the sumJournal of Combinatorial Theory, 1969