
Review of random multiple access methods for massive machine type communication
Author(s) -
Матвеев Николай Валентинович,
Тюрликов Андрей Михайлович
Publication year - 2020
Publication title -
informacionno-upravlâûŝie sistemy
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.202
H-Index - 6
eISSN - 2541-8610
pISSN - 1684-8853
DOI - 10.31799/1684-8853-2019-6-54-67
Subject(s) - random access , computer science , communications system , distributed computing , coding (social sciences) , lossy compression , set (abstract data type) , algorithm , theoretical computer science , computer network , artificial intelligence , mathematics , statistics , programming language
Intensive research is currently underway in the field of data transmission systems for the Internet of Things in relation to various scenarios of Massive Machine Type Communication. The presence of a large number of devices in such systems necessitates the use the methods of random multiple access to a common communication channel. It is proposed in some works to increase the channel utilization efficiency by the use of error correction coding methods for conflict resolution (Coded Random Access). The vast variety of options for using such communication systems has made it impossible to compare algorithms implementing this approach under the same conditions. This is a problem that restrains the development of both the theory and practice of using error correction code methods for conflict resolution. Purpose: Developing a unified approach to the description of random multiple access algorithms; performing, on the base on this approach, a review and comparative analysis of algorithms in which error correction code methods are used for conflict resolution. Results: A model of a random multiple access system is formulated in the form of a set of assumptions that reflect both the features of various scenarios of Massive Machine Type Communication and the main features of random multiple access algorithms, including Coded Random Access approaches. The system models are classified by the following features: 1) a finite or infinite number of subscribers; 2) stable, unstable or metastable systems; 3) systems with retransmissions or without them; 4) systems with losses or without them. For a lossy system, the main characteristics are Throughput (the proportion of successfully delivered messages) and Packet Loss Rate (probability of a message loss). For a lossless system, the basic characteristics are the algorithm speed and the average delay. A systematic review and comparative analysis of Coded Random Access algorithms have been carried out. The result of the comparative analysis is presented in a visual tabular form. Practical relevance: The proposed model of a random multiple access system can be used as a methodological basis for research and development of random multiple access algorithms for both existing and new scenarios of Massive Machine Type Communication. The systematic results of the review allow us to identify the promising areas of research in the field of data transmission systems for the Internet of Things.