Non-asymptotic Coded Slotted ALOHA

Coding for random access communication is a key challenge in Internet of Things applications. In this paper, the well-known scheme of Coded Slotted Aloha (CSA) is considered and its performance is analyzed in the non-asymptotic regime where the frame length and the number of users are finite. A density evolution framework is provided to describe the dynamics of decoding, and fundamental limits are found on the maximum channel load (i.e., the number of active users per time slot) that allows reliable communication (successful decoding). Finally, scaling laws are established, describing the non-asymptotic relation between the probability of error, the number of users, and the channel load.

[1]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[2]  Lawrence G. Roberts,et al.  ALOHA packet system with and without slots and capture , 1975, CCRV.

[3]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[4]  L. Schulman.  In: Finite size scaling and numerical simulation of statistical systems , 1990 .

[5]  N. Wormald.  Differential Equations for Random Processes and Random Graphs , 1995 .

[6]  N. Wormald.  The differential equation method for random graph processes and greedy algorithms , 1999 .

[7]  Abdelaziz Amraoui,et al.  ASYMPTOTIC AND FINITE-LENGTH OPTIMIZATION OF LDPC CODES , 2006 .

[8]  Riccardo De Gaudenzi,et al.  Contention Resolution Diversity Slotted ALOHA (CRDSA): An Enhanced Random Access Schemefor Satellite Access Packet Networks , 2007, IEEE Transactions on Wireless Communications.

[9]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[10]  Andrea Montanari,et al.  Finite-Length Scaling for Iteratively Decoded LDPC Ensembles , 2004, IEEE Transactions on Information Theory.

[11]  Gianluigi Liva,et al.  Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA , 2011, IEEE Transactions on Communications.

[12]  Xu Chen,et al.  Many-access channels: The Gaussian case with random user activities , 2014, 2014 IEEE International Symposium on Information Theory.

[13]  Marco Chiani,et al.  Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access , 2014, IEEE Transactions on Information Theory.

[14]  Giuseppe Cocco,et al.  Modern Random Access Protocols , 2016, Found. Trends Netw..

[15]  Yury Polyanskiy,et al.  A perspective on massive random-access , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[16]  Jun Cheng,et al.  A user-independent serial interference cancellation based coding scheme for the unsourced random access Gaussian channel , 2017, 2017 IEEE Information Theory Workshop (ITW).

[17]  Petar Popovski,et al.  Broadcast Coded Slotted ALOHA: A Finite Frame Length Analysis , 2015, IEEE Transactions on Communications.

[18]  Cedomir Stefanovic,et al.  Finite-Length Analysis of Frameless ALOHA With Multi-User Detection , 2017, IEEE Communications Letters.

[19]  Alexandre Graell i Amat,et al.  On Frame Asynchronous Coded Slotted ALOHA: Asymptotic, Finite Length, and Delay Analysis , 2017, IEEE Transactions on Communications.

[20]  Xu Chen,et al.  Capacity of Gaussian Many-Access Channels , 2016, IEEE Transactions on Information Theory.

[21]  Michelle Effros,et al.  Random Access Channel Coding in the Finite Blocklength Regime , 2021, IEEE Transactions on Information Theory.

[22]  Gianluigi Liva,et al.  Finite-Length Analysis of Irregular Repetition Slotted ALOHA in the Waterfall Region , 2018, IEEE Communications Letters.