Coded slotted ALOHA schemes for erasure channels
- Publication Type:
- Conference Proceeding
- 2016 IEEE International Conference on Communications, ICC 2016, 2016
- Issue Date:
Files in This Item:
|ICC16 Coded slotted ALOHA schemes for erasure channels.pdf||Accepted Manuscript version||213.45 kB|
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2016 IEEE. 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 ϵ = 0.1 and 86% for ϵ = 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.
Please use this identifier to cite or link to this item: