In this paper we investigate the coded slotted ALOHA (CSA) schemes with repetition codes and maximum distance separable (MDS) codes over erasure channels. We derive the extrinsic information transfer (EXIT) functions of the CSA schemes over erasure channels, which allow an asymptotic analysis of the packet recovering process. Moreover, we define a traffic load threshold provided that the recovered probability is more than a given recovery ratio. The optimal distribution of the codes chosen by users in the CSA schemes is then designed to maximize the peak throughput and traffic load threshold. By performing the asymptotic analysis, we show that our optimal distributions improve the traffic load threshold by 60% for e = 0.1 and 86% for e = 0.135 compared to the optimal distribution for collision channels. Using repetition codes as an example, simulation results show that the obtained distributions enhance the peak throughput for erasure channels when both packet erasure channels and slot erasure channels are considered.
['Zhuo Sun', 'Yixuan Xie', 'Jinhong Yuan', 'Tao Yang']
Coded slotted ALOHA schemes for erasure channels