Coded slotted ALOHA schemes for erasure channels

Sun, Z; Xie, Y; Yuan, J; Yang, T

Coded slotted ALOHA schemes for erasure channels

Sun, Z Xie, Y Yuan, J Yang, T

Permalink

Publication Type:: Conference Proceeding
Citation:: 2016 IEEE International Conference on Communications, ICC 2016, 2016
Issue Date:: 2016-07-12

Closed Access

	Filename	Description	Size
	ICC16 Coded slotted ALOHA schemes for erasure channels.pdf	Accepted Manuscript version	213.45 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Sun, Z	en_US
dc.contributor.author	Xie, Y	en_US
dc.contributor.author	Yuan, J	en_US
dc.contributor.author	Yang, T https://orcid.org/0000-0002-9870-6866	en_US
dc.date.issued	2016-07-12	en_US
dc.identifier.citation	2016 IEEE International Conference on Communications, ICC 2016, 2016	en_US
dc.identifier.isbn	9781479966646	en_US
dc.identifier.uri	http://hdl.handle.net/10453/57942
dc.description.abstract	© 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.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DE150100636
dc.relation.ispartof	2016 IEEE International Conference on Communications, ICC 2016	en_US
dc.relation.isbasedon	10.1109/ICC.2016.7510794	en_US
dc.title	Coded slotted ALOHA schemes for erasure channels	en_US
dc.type	Conference Proceeding
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

© 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:

http://hdl.handle.net/10453/57942