Abstract
The multiple access issue caused by the massive connections of devices is the key design aspect in the machine-to-machine communication system. As an uncoordinated access scheme, coded slotted ALOHA (CSA) is proposed and well studied to enable random access and high throughput simultaneously with no grant process. It shows efficient performance when the payloads are small. However, the CSA does suffer from the stopping set problem: the Successive Interference Cancellation (SIC) decoding process of CSA would come to a jam when normalized offered traffic is large. We propose an enhanced scheme based on CSA, that is, adding a novel physical layer feedback scheme on CSA to initiate the SIC decoding when there is no degree-1 slot. Considering the overhead of the feedback, simulations show that the proposed scheme can increase the number of successfully accessed devices in one frame.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
M2M Whie Paper: The Interoperability Enabler for the Entire M2M and IoT Ecosystem, April 2016. http://www.onem2m.org
Cellular Networks for Massive IoT, April 2016. https://www.ericsson.com
LTE-M - Optimizing LTE for the Internet of Things: White Paper, April 2016. https://networks.nokia.com
Chang, C.H., Chang, R.Y.: Design and analysis of multichannel slotted ALOHA for machine-to-machine communication. In: IEEE Global Communications Conference (GLOBECOM), San Diego, CA, pp. 1–6 (2015)
Yuan, J.: Coded slotted Aloha (CSA) schemes for machine-to-machine communications. In: 2015 9th International Conference on Signal Processing and Communication Systems (ICSPCS), Cairns, QLD, pp. 1–2 (2015)
Dhillon, H., Huang, H., Viswanathan, H., Valenzuela, R.: Fundamentals of throughput maximization with random arrivals for M2M communications. IEEE Trans. Commun. 62(11), 4094–4109 (2014)
Cassini, E., Gaudenzi, R.D., del Rio Herrero, O.: Contention resolution diversity slotted ALOHA (CRDSA): an enhanced random access scheme for satellite access packet networks. IEEE Trans. Wirel. Commun. 6(4), 1408–1419 (2007)
Liva, G.: Graph-based analysis and optimization of contention resolution diversity slotted ALOHA. IEEE Trans. Commun. 59(2), 477–487 (2011)
Ghanbarinejad, M., Schlegel, C.: Irregular repetition slotted ALOHA with multiuser detection. In: 2013 10th Annual Conference on Wireless On-demand Network Systems and Services (WONS), 18–20 March 2013, pp. 201–205 (2013)
Paolini, E., Liva, G., Chiani, M.: High throughput random access via codes on graphs: coded slotted ALOHA. In: Proceedings of IEEE International Conference on Communications, Kyoto, Japan, pp. 1–6, January 2011
Stefanovic, C., Popovski, P.: ALOHA random access that operates as a rateless code. IEEE Trans. Commun. 61(11), 4653–4662 (2013)
Ivanov, M., Brannstrom, F., Amat, A.G., Popvski, P.: Error floor analysis of coded slotted ALOHA over packet erasure channels. IEEE Commun. Lett. 19(3), 419–422 (2015)
Acknowledgments
This work is supported by the 863 project No. 2015AA01A706, 111 Project of China under Grant B14010, and National Natural Science Foundation of China under Grant No. 61421001.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Hanxiao, Y., Dai, J., Zhongwei, Z., Ce, S., Jingxuan, H., Zesong, F. (2018). A Novel Feedback Method to Enhance the Graphical Slotted ALOHA in M2M Communications. In: Chen, Q., Meng, W., Zhao, L. (eds) Communications and Networking. ChinaCom 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 209. Springer, Cham. https://doi.org/10.1007/978-3-319-66625-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-66625-9_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66624-2
Online ISBN: 978-3-319-66625-9
eBook Packages: Computer ScienceComputer Science (R0)