Coded Slotted ALOHA for Erasure Channels: Design and Throughput Analysis

In this paper, we investigate the design and analysis of coded slotted ALOHA (CSA) schemes in the presence of channel erasure. We design the code probability distributions for CSA schemes with repetition codes and maximum distance separable codes to maximize the expected traffic load, under both pac...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 65; no. 11; pp. 4817 - 4830
Main Authors Sun, Zhuo, Xie, Yixuan, Yuan, Jinhong, Yang, Tao
Format Journal Article
LanguageEnglish
Published New York IEEE 01.11.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Asymptotic properties
Australia
Bipartite graph
Channels
Coded slotted ALOHA
Communications traffic
Design analysis
erasure channel
Information transfer
Interference
Probability distribution
Receivers
Silicon carbide
successive interference cancellation
Throughput
Online AccessGet full text

Cover

More Information
Summary:In this paper, we investigate the design and analysis of coded slotted ALOHA (CSA) schemes in the presence of channel erasure. We design the code probability distributions for CSA schemes with repetition codes and maximum distance separable codes to maximize the expected traffic load, under both packet erasure channels and slot erasure channels. We derive the extrinsic information transfer (EXIT) functions of CSA schemes over erasure channels. By optimizing the convergence behavior of the derived EXIT functions, the code probability distributions to achieve the maximum expected traffic load are obtained. Then, we derive the asymptotic throughput of CSA schemes over erasure channels. In addition, we validate that the asymptotic throughput can give a good approximation to the throughput of CSA schemes over erasure channels.
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2017.2734649