LAUSR

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.