RESEARCH OF RANDOM ACCESS PROCEDURE ON MACHINE TYPE COMMUNICATION

被引:0
|
作者
Liao, Zhen [1 ]
Ji, Xiaodong [2 ]
Sun, Xiangqian [1 ]
Zhao, Huilin [1 ]
机构
[1] China Acad Informat & Commun Technol, Beijing, Peoples R China
[2] Beijing Univ Posts & Telecommun, Beijing, Peoples R China
关键词
Machine type communication; LTE; Random access;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Machine Type Communication (MTC) is machine to machine communications in cellular network. It plays the key role for intelligent services and there is a great market prospect for these services. Comparing with H2H communications, there are significant changes in service features. In 3GPP Release-13, there are three objectives of enhancement for MTC, including UE complexity reduction, coverage enhancement and UE power consumption reduction. The supported RF bandwidth has been agreed as 1.4MEZ and repetition technique for channels is considered to achieve coverage improvement. However, due to these improvement, if the conventional method continues to be used, the collision probability of PRACH transmission and the power consumption of MTC UEs will be higher than the legacy UEs. In order to alleviate this issue, this paper concentrates on the random access procedure on low cost MTC and it takes the coverage enhancement level into the consideration which isn't the dimension of legacy LTE system. It proposes a method about new mapping relationship between PRACH resource set and coverage enhancement level. By this way, it can reduce the collision probability and improve the utilization of radio resources, which consequently increases the success probability of random access and reduces the power consumption. Finally, the simulation result shows that the method can improve the performance of low cost MTC.
引用
收藏
页码:367 / 371
页数:5
相关论文
共 50 条
  • [1] On an Efficient Random Access Scheme for Capillary Machine Type Communication
    Ashrafuzzaman, Kazi
    Fapojuwo, Abraham O.
    2016 IEEE 41ST CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN), 2016, : 95 - 103
  • [2] Deep Reinforcement Learning for Random Access in Machine-Type Communication
    Awais Jadoon, Muhammad
    Pastore, Adriano
    Navarro, Monica
    Perez-Cruz, Fernando
    2022 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2022, : 2553 - 2558
  • [3] Random Access for Machine-Type Communication based on Bloom Filtering
    Pratas, Nuno K.
    Stefanovic, Cedomir
    Madueno, German Corrales
    Popovski, Petar
    2016 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2016,
  • [4] Power-Efficient Random Access Design for Machine Type Communication
    Yu, Hai
    Zou, Jun
    Xu, Chen
    ELECTRONICS, 2018, 7 (11):
  • [5] Learning Random Access Schemes for Massive Machine-Type Communication With MARL
    Jadoon, Muhammad Awais
    Pastore, Adriano
    Navarro, Monica
    Valcarce, Alvaro
    IEEE Transactions on Machine Learning in Communications and Networking, 2024, 2 : 95 - 109
  • [6] P-persistent massive random access mechanism for machine type communication
    Masoumeh Mokhtari Karchegani
    Behrouz Shahgholi Ghahfarokhi
    Telecommunication Systems, 2021, 78 : 169 - 185
  • [7] Services Ranking Based Random Access Scheme for Machine-Type Communication
    Dai, Lu
    Jia, Yunjian
    Chen, Zhengchuan
    Liang, Liang
    Li, Guojun
    COMMUNICATIONS, SIGNAL PROCESSING, AND SYSTEMS, CSPS 2018, VOL III: SYSTEMS, 2020, 517 : 950 - 961
  • [8] Coded Random Access with Multiple Coverage Classes for Massive Machine Type Communication
    Chae, Seungyeob
    Cho, Sangjin
    Kim, Sujin
    Rim, Minjoong
    2016 INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY CONVERGENCE (ICTC 2016): TOWARDS SMARTER HYPER-CONNECTED WORLD, 2016, : 882 - 886
  • [9] A novel random access scheme for stationary machine-type communication devices
    Zhang, Mingyu
    Li, Ying
    Guo, Xudong
    IET COMMUNICATIONS, 2018, 12 (19) : 2448 - 2453
  • [10] P-persistent massive random access mechanism for machine type communication
    Karchegani, Masoumeh Mokhtari
    Ghahfarokhi, Behrouz Shahgholi
    TELECOMMUNICATION SYSTEMS, 2021, 78 (02) : 169 - 185