A Novel Dynamically Differentiated Access Scheme for Massive Grant-Free NOMA

被引:0
|
作者
Wang, Yitian [1 ,2 ,3 ,4 ,5 ]
Zheng, Meng [1 ,2 ,3 ,4 ]
Yu, Haibin [1 ,2 ,3 ,4 ]
Liang, Wei [1 ,2 ,3 ,4 ]
机构
[1] Chinese Acad Sci, Shenyang Inst Automat, State Key Lab Robot, Shenyang 110016, Peoples R China
[2] Chinese Acad Sci, Shenyang Inst Automat, Key Lab Networked Control Syst, Shenyang 110016, Peoples R China
[3] Chinese Acad Sci, Inst Robot, Shenyang 110169, Peoples R China
[4] Chinese Acad Sci, Inst Intelligent Mfg, Shenyang 110169, Peoples R China
[5] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
基金
中国国家自然科学基金;
关键词
D O I
10.1109/VTC2022-Fall57202.2022.10012944
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Facing the dual challenges of massive access and time-sensitive traffics, grant-free non-orthogonal multiple access (GF-NOMA) emerges as a promising technology for implementing massive ultra-reliable and low-latency communications (mURLLC). In this paper, we propose a differentiated power level access (DPLA) policy that exploits the correlations among power levels of GF-NOMA, and implement DPLA by a dynamically distributed GF-NOMA framework. Further, a closed-form expression to the reliability of DPLA is analytically derived and the optimal framework parameters to maximize reliability are obtained. Finally, considering the traffic variation over time, we propose a dynamically-distributed differentiated-layered transmission ((DLT)-L-3) algorithm to improve the reliability online. Simulation results show that the proposed scheme in this work outweighs existing schemes in transmission reliability.
引用
收藏
页数:5
相关论文
共 50 条
  • [31] A Throughput Study of Grant-Free Multiple Access for Massive Wireless Communications
    Pyo, Chang-Woo
    Takizawa, Kenichi
    Moriyama, Masafumi
    Oodo, Masayuki
    Tezuka, Hayato
    Ishizu, Kentaro
    Kojima, Fumihide
    2017 20TH INTERNATIONAL SYMPOSIUM ON WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS (WPMC), 2017, : 529 - 534
  • [32] Asynchronous Grant-Free Massive Access With Doppler Frequency Offset in NTN
    Li, Yang
    Chen, Shuyi
    Meng, Weixiao
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2024, 13 (02) : 367 - 371
  • [33] Impact of Interference Subtraction on Grant-Free Multiple Access with Massive MIMO
    Valentini, Lorenzo
    Faedi, Alberto
    Chiani, Marco
    Paolini, Enrico
    IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), 2022, : 1318 - 1323
  • [34] Interference Cancellation Algorithms for Grant-Free Multiple Access With Massive MIMO
    Valentini, Lorenzo
    Chiani, Marco
    Paolini, Enrico
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2023, 71 (08) : 4665 - 4677
  • [35] Age of Information Minimization for Frameless ALOHA in Grant-Free Massive Access
    Huang, Yuhao
    Jiao, Jian
    Wang, Ye
    Zhang, Xingjian
    Wu, Shaohua
    Lu, Rongxing
    Zhang, Qinyu
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2023, 22 (12) : 9778 - 9792
  • [36] NOMA-Based Grant-Free Massive Access for Latency-Critical Internet of Things: A Scalable and Reliable Framework
    Kang C.G.
    Abebe A.T.
    Choi J.
    IEEE Internet of Things Magazine, 2023, 6 (03): : 12 - 18
  • [37] Modeling, Analysis, and Optimization of Grant-Free NOMA in Massive MTC via Stochastic Geometry
    Liu, Jiaqi
    Wu, Gang
    Zhang, Xiaoxu
    Fang, Shu
    Li, Shaoqian
    IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (06): : 4389 - 4402
  • [38] Grant-Free Code-Domain Random Access for Massive Access in Internet of Things
    Rao, Zhigang
    Jiao, Jian
    Wu, Shaohua
    Lu, Rongxing
    Zhang, Qinyu
    IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), 2022, : 4492 - 4497
  • [39] An Asynchronous Grant-Free Multiple Access Scheme with Rateless Codes for URLLC
    Zhang, Wei
    Zhou, Shidong
    Zhang, Xiujun
    2020 IEEE 92ND VEHICULAR TECHNOLOGY CONFERENCE (VTC2020-FALL), 2020,
  • [40] A CS-Based Grant-Free Media Access Scheme for NOMA-Based Industrial IoTs with Location Awareness
    Ruixia Li
    Wei Peng
    Chenxi Zhang
    International Journal of Wireless Information Networks, 2021, 28 : 412 - 420