Coded Slotted ALOHA for Erasure Channels: Design and Throughput Analysis

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

Coded Slotted ALOHA for Erasure Channels: Design and Throughput Analysis

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

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Communications, 2017, 65 (11), pp. 4817 - 4830
Issue Date:: 2017-11-01

Closed Access

	Filename	Description	Size
	07999275.pdf	Published Version	2.46 MB	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	2017-11-01	en_US
dc.identifier.citation	IEEE Transactions on Communications, 2017, 65 (11), pp. 4817 - 4830	en_US
dc.identifier.issn	0090-6778	en_US
dc.identifier.uri	http://hdl.handle.net/10453/123489
dc.description.abstract	© 2017 IEEE. 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.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DE150100636
dc.relation.ispartof	IEEE Transactions on Communications	en_US
dc.relation.isbasedon	10.1109/TCOMM.2017.2734649	en_US
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	Coded Slotted ALOHA for Erasure Channels: Design and Throughput Analysis	en_US
dc.type	Journal Article
utslib.citation.volume	11	en_US
utslib.citation.volume	65	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	en_US
utslib.for	0804 Data Format	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.issue	11	en_US
pubs.publication-status	Published	en_US
pubs.volume	65	en_US

Abstract:

© 2017 IEEE. 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.

Please use this identifier to cite or link to this item:

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