TY - GEN
T1 - Heterogeneous Machine-Type Communications in Cellular Networks
T2 - 2018 IEEE International Conference on Communications, ICC 2018
AU - Chen, Ziqi
AU - Smith, David B.
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/27
Y1 - 2018/7/27
N2 - One of the significant challenges for managing machine-to-machine (M2M) communication in cellular networks, such as LTE-A, is the overload of the radio access network due to very many machine type communication devices (MTCDs) requesting access in burst traffic. This problem can be addressed well by applying an access class barring (ACB) mechanism to regulate the number of MTCDs simultaneously participating in random access (RA). In this regard, here we present a novel deep reinforcement learning algorithm, first for dynamically adjusting the ACB factor in a uniform priority network. The algorithm is then further enhanced to accommodate heterogeneous MTCDs with different quality of service (QoS) requirements. Simulation results show that the ACB factor controlled by the proposed algorithm coincides with the theoretical optimum in a uniform priority network, and achieves higher access probability, as well as lower delay, for each priority class when there are heterogeneous QoS requirements.
AB - One of the significant challenges for managing machine-to-machine (M2M) communication in cellular networks, such as LTE-A, is the overload of the radio access network due to very many machine type communication devices (MTCDs) requesting access in burst traffic. This problem can be addressed well by applying an access class barring (ACB) mechanism to regulate the number of MTCDs simultaneously participating in random access (RA). In this regard, here we present a novel deep reinforcement learning algorithm, first for dynamically adjusting the ACB factor in a uniform priority network. The algorithm is then further enhanced to accommodate heterogeneous MTCDs with different quality of service (QoS) requirements. Simulation results show that the ACB factor controlled by the proposed algorithm coincides with the theoretical optimum in a uniform priority network, and achieves higher access probability, as well as lower delay, for each priority class when there are heterogeneous QoS requirements.
UR - http://www.scopus.com/inward/record.url?scp=85051431675&partnerID=8YFLogxK
U2 - 10.1109/ICC.2018.8422775
DO - 10.1109/ICC.2018.8422775
M3 - Conference contribution
SN - 9781538631805
T3 - IEEE International Conference on Communications
BT - 2018 IEEE International Conference on Communications, ICC 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 20 May 2018 through 24 May 2018
ER -