P-persistent massive random access mechanism for machine type communication

2021 ◽  
Author(s):  
Masoumeh Mokhtari Karchegani ◽  
Behrouz Shahgholi Ghahfarokhi
Keyword(s):  
Random Access ◽  
Machine Type ◽  
Machine Type Communication

Pre-Backoff Based Random Access with Priority for 5G Machine-Type Communication

2017 ◽  
Author(s):  
Linpei Li ◽  
Xiangming Wen ◽  
Zhaoming Lu ◽  
Qi Pan ◽  
Wenpeng Jing
Keyword(s):  
Random Access ◽  
Machine Type ◽  
Machine Type Communication

A Q-learning approach for machine-type communication random access in LTE-Advanced

2018 ◽  
Vol 71 (3) ◽  
pp. 397-413 ◽  
Author(s):  
Amaal S. A. El-Hameed ◽  
Khaled M. F. Elsayed
Keyword(s):  
Random Access ◽  
Learning Approach ◽  
Q Learning ◽  
Machine Type ◽  
Lte Advanced ◽  
Machine Type Communication

scholarly journals Signal power and energy-per-bit optimization problems in systems mMTC

2021 ◽  
pp. 51-58
Author(s):  
Artem Burkov
Keyword(s):  
Optimization Problems ◽  
Random Access ◽  
Delivery Ratio ◽  
Signal Power ◽  
Average Delay ◽  
Access Methods ◽  
Machine Type ◽  
Machine Type Communication ◽  
Self Powered ◽  
Internet Of Things Technology

Introduction: Currently, the issues of Internet of Things technology are being actively studied. The operation of a large number of various self-powered sensors is within the framework of a massive machine-type communication scenario, using random access methods. Topical issues in this type of communication are how to reduce the transmission signal power and to increase the device lifetime by reducing the consumed energy per bit. Purpose: Formulation and analysis of the problems of minimizing the transmission power and consumed energy per bit in systems with or without retransmissions in order to obtain the achievability bounds. Results: A model of the system is described, within which four problems are formulated and described, concerning the signal power minimization and energy consumption for given parameters (the number of information bits, the spectral efficiency of the system, and the Packet Delivery Ratio). The numerical results of solving these optimization problems are presented. They make it possible to obtain the achievability bounds for the considered characteristics in systems with or without losses. The lower bounds obtained by the Shannon formula are also presented, assuming that the message length is not limited. The obtained results showed that solving the minimization problem with respect to one of the parameters (signal power or consumed energy per bit) does not minimize the second parameter. This difference is most significant for information messages of a small length, which is common in IoT scenarios. Practical relevance: The results obtained allow you to assess the potential for minimizing the transmission signal power and consumed energy per bit in random multiple access systems with massive machine-type communication scenarios. Discussion: The presented problems were solved without taking into account the average delay of message transmission; the introduction of such a limitation should increase the transmitted signal power and consumed energy per bit.

Sign in / Sign up

Export Citation Format

Share Document