SARA: Sparse Code Multiple Access-Applied Random Access for IoT Devices

被引:45
作者
Moon, Seokjae [1 ]
Lee, Hyun-Suk [1 ]
Lee, Jang-Won [1 ]
机构
[1] Yonsei Univ, Dept Elect & Elect Engn, Seoul 03722, South Korea
来源
IEEE INTERNET OF THINGS JOURNAL | 2018年 / 5卷 / 04期
关键词
Average access delay; average number of preamble transmissions; Internet of Things (IoT) connectivity massive; machine type communication (mMTC); nonorthogonal multiple access (NOMA); RA success probability; RA throughput; random access (RA); sparse code multiple access (SCMA); TO-MACHINE COMMUNICATIONS; A RANDOM-ACCESS; RESOURCE-ALLOCATION; 5G; NETWORKS; CHALLENGES; INTERNET; SYSTEMS; THINGS; SCMA;
D O I
10.1109/JIOT.2018.2835828
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we study a random access (RA) procedure to support the massive connectivity of the Internet of Things (IoT) devices, also known as the IoT connectivity. Compared with the previous RA procedures that have limitations to support the IoT connectivity due to the exponentially increased access delay, we develop an RA procedure by applying the sparse code multiple access to reduce the access delay and increase the ratio of the IoT devices that successfully complete their RA procedures. We provide the theoretical performance analysis of the proposed RA procedure with the performance metrics, such as the RA success probability, the average access delay, the RA throughput, and the average number of preamble transmissions. Then, we provide the numerical results to evaluate the performance of the proposed RA procedure based on our analysis and the ns-3 simulator. Numerical results show that our proposed RA procedure is able to support the massive connectivity requirement with improved RA performance metrics compared with the conventional RA procedures.
引用
收藏
页码:3160 / 3174
页数:15
相关论文
共 50 条
  • [1] Sparse Code Multiple Access-Based Edge Computing for IoT Systems
    Alnoman, Ali
    Erkucuk, Serhat
    Anpalagan, Alagan
    IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (04): : 7152 - 7161
  • [2] A New Multiple Access Technique for 5G: Power Domain Sparse Code Multiple Access (PSMA)
    Moltafet, Mohammad
    Mokari, Nader
    Javan, Mohammad Reza
    Saeedi, Hamid
    Pishro-Nik, Hossein
    IEEE ACCESS, 2018, 6 : 747 - 759
  • [3] An Error Rate Comparison of Power Domain Non-Orthogonal Multiple Access and Sparse Code Multiple Access
    Luo, Qu
    Gao, Pengyu
    Liu, Zilong
    Xiao, Lixia
    Mheich, Zeina
    Xiao, Pei
    Maaref, Amine
    IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY, 2021, 2 : 500 - 511
  • [4] Sparse Code Multiple Access
    Nilopour, Hosein
    Baligh, Hadi
    2013 IEEE 24TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2013, : 332 - 336
  • [5] Sparse Code Multiple Access: Potentials and Challenges
    Rebhi, Manel
    Hassan, Kais
    Raoof, Kosai
    Charge, Pascal
    IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY, 2021, 2 : 1205 - 1238
  • [6] Sparse Autoencoder for Sparse Code Multiple Access
    Singh, Medini
    Mishra, Deepak
    Vanidevi, M.
    3RD INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE IN INFORMATION AND COMMUNICATION (IEEE ICAIIC 2021), 2021, : 353 - 358
  • [7] Sparse Code Multiple Access applied in the Generalized Frequency Division Multiplexing
    Aquino, Guilherme Pedro
    Mendes, Luciano Leonel
    2018 IEEE 5G WORLD FORUM (5GWF), 2018, : 49 - 54
  • [8] A Tutorial on Decoding Techniques of Sparse Code Multiple Access
    Chaturvedi, Saumya
    Liu, Zilong
    Bohara, Vivek Ashok
    Srivastava, Anand
    Xiao, Pei
    IEEE ACCESS, 2022, 10 : 58503 - 58524
  • [9] Analyzing Uplink Grant-Free Sparse Code Multiple Access System in Massive IoT Networks
    Lai, Ke
    Lei, Jing
    Deng, Yansha
    Wen, Lei
    Chen, Gaojie
    Liu, Wei
    IEEE INTERNET OF THINGS JOURNAL, 2022, 9 (07) : 5561 - 5577
  • [10] Sparse code multiple access on the generalized frequency division multiplexing
    Aquino, Guilherme P.
    Mendes, Luciano L.
    EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2020, 2020 (01)