LTE/LTE-A Random Access for Massive Machine-Type Communications in Smart Cities

被引:129
作者
Ali, Md Shipon [1 ]
Hossain, Ekram [2 ]
Kim, Dong In [3 ]
机构
[1] Univ Manitoba, Winnipeg, MB R3T 2N2, Canada
[2] Univ Manitoba, Dept Elect & Comp Engn, Winnipeg, MB R3T 2N2, Canada
[3] Sungkyunkwan Univ, Coll Informat & Commun Engn, Suwon, South Korea
基金
新加坡国家研究基金会; 加拿大自然科学与工程研究理事会;
关键词
M2M COMMUNICATIONS;
D O I
10.1109/MCOM.2017.1600215CM
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Massive MTC over cellular networks is expected to be an integral part of wireless smart city applications. The LTE/LTE-A technology is a major candidate for provisioning of MTC applications. However, due to the diverse characteristics of payload size, transmission periodicity, power efficiency, and QoS requirement, MTC poses huge challenges to LTE/LTE-A technologies. In particular, efficient management of massive random access is one of the most critical challenges. In the case of massive random access attempts, the probability of preamble collision drastically increases, and thus the performance of LTE/LTE-A random access degrades sharply. In this context, this article reviews the current state-of-the-art proposals to control massive random access of MTC devices in LTE/LTE-A networks. The proposals are compared in terms of five major metrics: access delay, access success rate, power efficiency, QoS guarantee, and the effect on HTC. To this end, we propose a novel collision resolution random access model for massive MTC over LTE/LTE-A. Our proposed model basically resolves the preamble collisions instead of avoidance and targets the management of massive and bursty access attempts. Simulations of our proposed model show huge improvements in random access success rate compared to the standard slotted-Aloha- based models. The new model can also coexist with existing LTE/LTE-A MAC protocol and ensure high reliability and time-efficient network access.
引用
收藏
页码:76 / 83
页数:8
相关论文
共 15 条
  • [1] [Anonymous], 2011, 3GPP TR 37 868 V11 0
  • [2] [Anonymous], 2015, 3GPP TS 36 321 V12 7
  • [3] [Anonymous], 2012, 3GPP RAN WG2 77
  • [4] Cheng JP, 2011, IEEE GLOBE WORK, P368, DOI 10.1109/GLOCOMW.2011.6162473
  • [5] Farhadi G., 2013, P IEEE 78TH VTC
  • [6] Spatial Group Based Random Access for M2M Communications
    Jang, Han Seung
    Kim, Su Min
    Ko, Kab Seok
    Cha, Jiyoung
    Sung, Dan Keun
    [J]. IEEE COMMUNICATIONS LETTERS, 2014, 18 (06) : 961 - 964
  • [7] Analysis of contention tree algorithms
    Janssen, AJEM
    de Jong, MJM
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (06) : 2163 - 2172
  • [8] Cooperative Access Class Barring for Machine-to-Machine Communications
    Lien, Shao-Yu
    Liau, Tzu-Huan
    Kao, Ching-Yueh
    Chen, Kwang-Cheng
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2012, 11 (01) : 27 - 32
  • [9] Lo A., 2011, P 27TH WIRELESS WORL
  • [10] Madueño GC, 2015, IEEE ICC, P2997, DOI 10.1109/ICC.2015.7248783