Coded slotted Aloha (CSA) schemes for machine-to-machine communications

For the future machine-to-machine communications (M2M), efficient random multiple access protocols are required to accommodate a massive number of uncoordinated transmissions. It is known that packet contention is a critical issue for increasing the throughput in the uncoordinated transmissions. Thus, how to deal with packet contentions is the key for novel efficient multiple access schemes of future wireless communication networks. In this talk, we investigate the design and analysis of random multiple access schemes and coding techniques for the future machine to machine. We design the optimal coded slotted Aloha (CSA) scheme with repetition codes and maximum distance separable (MDS) codes under both packet erasure channels and slot erasure channels. We derive an upper bound on the throughput of CSA scheme. We show that our optimal distributions improve the maximum traffic load and enhance the throughput of the CSA scheme significantly. Moreover, we propose a Gaussian elimination (GE) aided successive interference cancelation (SIC) decoding (GE-SIC) method to further improve the throughput of the CSA scheme. We demonstrate that by introducing the GE decoding to recover packets that cannot be decoded by the SIC decoding, the peak throughput of CSA scheme can reach as high as 90%.