Grant-Free Rateless Multiple Access: A Novel Massive Access Scheme for Internet of Things

Rateless multiple access (RMA) is a novel non-orthogonal multiple access framework that is promising for massive access in Internet of Things due to its high efficiency and low complexity. In the framework, after certain registration, each active user, respectively, transmits to the access point randomly based on an assigned random access control function until receiving an acknowledgement. In this letter, by exploiting the intrinsic access pattern of each user, we propose a grant-free RMA scheme, which no longer needs the registration process as in the original RMA, thus greatly reduces the signaling overhead and system latency. Furthermore, we propose a low-complexity joint iterative detection and decoding algorithm in which the channel estimation, the active user detection, and the information decoding are done simultaneously. Finally, we propose a method based on density evolution to evaluate the system performance.

[1]  Carsten Bockelmann,et al.  Sparsity Aware Multiuser detection for Machine to Machine communication , 2012, 2012 IEEE Globecom Workshops.

[2]  Erik Dahlman,et al.  4G: LTE/LTE-Advanced for Mobile Broadband , 2011 .

[3]  Yan Chen,et al.  Multi-Carrier Rateless Multiple Access: A Novel Protocol for Dynamic Massive Access , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

[4]  Amir H. Banihashemi,et al.  Performance of Belief Propagation for Decoding LDPC Codes in the Presence of Channel Estimation Error , 2007, IEEE Transactions on Communications.

[5]  Emre Aktas Iterative Message Passing for Pilot-Assisted Multiuser Detection in MC-CDMA Systems , 2012, IEEE Transactions on Communications.

[6]  Armin Dekorsy,et al.  M2M massive wireless access: Challenges, research issues, and ways forward , 2013, 2013 IEEE Globecom Workshops (GC Wkshps).

[7]  A. Hasman,et al.  Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .

[8]  Petar Popovski,et al.  Towards Massive, Ultra-Reliable, and Low-Latency Wireless Communication with Short Packets , 2015 .

[9]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[10]  Peter A. Hoeher,et al.  Graph-Based Soft Channel and Data Estimation for MIMO Systems with Asymmetric LDPC Codes , 2008, 2008 IEEE International Conference on Communications.

[11]  Ralf R. Müller,et al.  Ieee Transactions on Communications, Accepted for Publication 1 Iterative Lmmse Channel Estimation and Decoding Based on Probabilistic Bias , 2022 .

[12]  Petar Popovski,et al.  Towards Massive, Ultra-Reliable, and Low-Latency Wireless: The Art of Sending Short Packets , 2015, ArXiv.

[13]  Jinghu Chen,et al.  Density evolution for two improved BP-Based decoding algorithms of LDPC codes , 2002, IEEE Communications Letters.

[14]  Carsten Bockelmann,et al.  Iterative Soft Interference Cancellation for Sparse BPSK Signals , 2015, IEEE Communications Letters.

[15]  Georgios B. Giannakis,et al.  Exploiting Sparse User Activity in Multiuser Detection , 2011 .

[16]  Li Ping,et al.  Interleave division multiple-access , 2006, IEEE Trans. Wirel. Commun..