Abstract
Currently, high connectivity in the mMTC system can be achieved by the cutting-edge multiple access approaches. Nevertheless, a comprehensive multiple access scheme to cover both high connectivity and reliability in grant-free random access system is potentially demanded by the future MTC applications. Motivated by this, a novel spreading based multiple access technique named tandem spreading multiple access has been proposed. This approach is initiated from the scheme called tandem spreading network-coded division multiple access (TSNDMA) [30]. Then a generalized version of TSNDMA named coded tandem spreading multiple access (CTSMA) is introduced [31]. In the following subsections, those two versions are presented. In addition, the multi-slot design of CTSMA is described [32].
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
References
G. Ma, B. Ai, F. Wang, Z. Zhong, Coded tandem spreading for grant-free random access system with massive connections, in GLOBECOM 2017 – 2017 IEEE Global Communications Conference, Dec 2017, pp. 1–6
G. Ma, B. Ai, F. Wang, Z. Zhong, Tandem spreading network-coded division multiple access. IEEE Trans. Ind. Inf. 13(1), 390–398 (2017)
G. Ma, B. Ai, F. Wang, X. Chen, Z. Zhong, Z. Zhao, H. Guan, Coded tandem spreading multiple access for massive machine-type communications. IEEE Wirel. Commun. 25(2), 75–81 (2018)
G. Ma, B. Ai, F. Wang, Z. Zhong, Joint design of coded tandem spreading multiple access and coded slotted aloha for massive machine-type communications. IEEE Trans. Ind. Inf. 14(9), 4064–4071 (2018)
K.H. Rosen, B. Goddard, K. O’Bryant, Elementary Number Theory and Its Applications (Pearson/Addison Wesley, Boston, MA, 2005)
J.S. Plank, C. Huang, Tutorial: erasure coding for storage applications, in Slides Presented at FAST-2013: 11th Usenix Conference on File and Storage Technologies, San Jose, Feb 2013
F.J. Macwilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes. Parts I, II (North-Holland Pub. Co, Amsterdam, Netherlands, 1977)
R. Singleton, Maximum distance q-ary codes. IEEE Trans. Inf. Theory 10(2), 116–118 (1964)
G. Liva, Graph-based analysis and optimization of contention resolution diversity slotted aloha. IEEE Trans. Commun. 59(2), 477–487 (2011)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Wang, F., Ma, G. (2019). Tandem Spreading Multiple Access. In: Massive Machine Type Communications. SpringerBriefs in Electrical and Computer Engineering. Springer, Cham. https://doi.org/10.1007/978-3-030-13574-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-13574-4_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-13573-7
Online ISBN: 978-3-030-13574-4
eBook Packages: EngineeringEngineering (R0)