面向5G网络低延迟接入的noma增强两步RACH流程

IF 8.9 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Dawei Nie;Wenjuan Yu;Chuan Heng Foh;Qiang Ni
{"title":"面向5G网络低延迟接入的noma增强两步RACH流程","authors":"Dawei Nie;Wenjuan Yu;Chuan Heng Foh;Qiang Ni","doi":"10.1109/JIOT.2024.3521340","DOIUrl":null,"url":null,"abstract":"Random access channel (RACH) procedure is critical to support a multitude of devices transmitting small data payloads while ensuring low-latency access. In 3GPP Release 16, a two-step RACH is proposed to alleviate signaling overhead and access latency. While benefits are noticeable, collisions still persist. In this article, we propose a novel nonorthogonal multiple access (NOMA)-enhanced two-step RACH scheme (NOMA-RACH) that jointly leverages the benefits of access class barring (ACB), two-step RACH, and NOMA random access (NOMA-RA) to further enhance the performance. We conduct a holistic study that accounts for entire access latency. The scheme optimizes NOMA access probabilities, utilizes an adjustable barring mechanism for delay-sensitive devices, and identifies the optimal barring rate for low latency. We develop a Markov chain model to analyze NOMA access and derive the optimal access probabilities and throughput of NOMA blocks. To cope with the practical scenarios with constantly changing user equipment (UE) traffic, we propose a deep contextual multiarmed bandit (DCMAB) model that optimizes the NOMA throughput and dynamically adjusts the barring rate based on the observable channel feedback. Our simulation results demonstrate that the DCMAB model performs better than benchmark schemes and remains close to the optimal latency confirming the effectiveness of our proposed scheme under changing UE traffic.","PeriodicalId":54347,"journal":{"name":"IEEE Internet of Things Journal","volume":"12 9","pages":"11568-11580"},"PeriodicalIF":8.9000,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A NOMA-Enhanced Two-Step RACH Procedure for Low-Latency Access in 5G Networks\",\"authors\":\"Dawei Nie;Wenjuan Yu;Chuan Heng Foh;Qiang Ni\",\"doi\":\"10.1109/JIOT.2024.3521340\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Random access channel (RACH) procedure is critical to support a multitude of devices transmitting small data payloads while ensuring low-latency access. In 3GPP Release 16, a two-step RACH is proposed to alleviate signaling overhead and access latency. While benefits are noticeable, collisions still persist. In this article, we propose a novel nonorthogonal multiple access (NOMA)-enhanced two-step RACH scheme (NOMA-RACH) that jointly leverages the benefits of access class barring (ACB), two-step RACH, and NOMA random access (NOMA-RA) to further enhance the performance. We conduct a holistic study that accounts for entire access latency. The scheme optimizes NOMA access probabilities, utilizes an adjustable barring mechanism for delay-sensitive devices, and identifies the optimal barring rate for low latency. We develop a Markov chain model to analyze NOMA access and derive the optimal access probabilities and throughput of NOMA blocks. To cope with the practical scenarios with constantly changing user equipment (UE) traffic, we propose a deep contextual multiarmed bandit (DCMAB) model that optimizes the NOMA throughput and dynamically adjusts the barring rate based on the observable channel feedback. Our simulation results demonstrate that the DCMAB model performs better than benchmark schemes and remains close to the optimal latency confirming the effectiveness of our proposed scheme under changing UE traffic.\",\"PeriodicalId\":54347,\"journal\":{\"name\":\"IEEE Internet of Things Journal\",\"volume\":\"12 9\",\"pages\":\"11568-11580\"},\"PeriodicalIF\":8.9000,\"publicationDate\":\"2025-01-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Internet of Things Journal\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10841820/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Internet of Things Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10841820/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

随机访问通道(RACH)过程对于支持大量设备传输小数据有效负载,同时确保低延迟访问至关重要。在3GPP Release 16中,提出了两步RACH来减轻信令开销和访问延迟。虽然好处显而易见,但碰撞仍然存在。在本文中,我们提出了一种新的非正交多址(NOMA)增强的两步RACH方案(NOMA-RACH),它共同利用了访问类限制(ACB)、两步RACH和NOMA随机访问(NOMA- ra)的优点来进一步提高性能。我们对整个访问延迟进行了全面的研究。该方案优化了NOMA访问概率,对延迟敏感设备采用了可调的限制机制,并确定了低延迟的最佳限制率。我们建立了一个马尔可夫链模型来分析NOMA访问,并推导出NOMA块的最优访问概率和吞吐量。为了应对用户设备流量不断变化的实际场景,我们提出了一种深度上下文多臂强盗(DCMAB)模型,该模型优化了NOMA吞吐量,并根据可观察到的信道反馈动态调整了封锁率。我们的仿真结果表明,DCMAB模型比基准方案性能更好,并且保持接近最优延迟,证实了我们提出的方案在不断变化的UE流量下的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A NOMA-Enhanced Two-Step RACH Procedure for Low-Latency Access in 5G Networks
Random access channel (RACH) procedure is critical to support a multitude of devices transmitting small data payloads while ensuring low-latency access. In 3GPP Release 16, a two-step RACH is proposed to alleviate signaling overhead and access latency. While benefits are noticeable, collisions still persist. In this article, we propose a novel nonorthogonal multiple access (NOMA)-enhanced two-step RACH scheme (NOMA-RACH) that jointly leverages the benefits of access class barring (ACB), two-step RACH, and NOMA random access (NOMA-RA) to further enhance the performance. We conduct a holistic study that accounts for entire access latency. The scheme optimizes NOMA access probabilities, utilizes an adjustable barring mechanism for delay-sensitive devices, and identifies the optimal barring rate for low latency. We develop a Markov chain model to analyze NOMA access and derive the optimal access probabilities and throughput of NOMA blocks. To cope with the practical scenarios with constantly changing user equipment (UE) traffic, we propose a deep contextual multiarmed bandit (DCMAB) model that optimizes the NOMA throughput and dynamically adjusts the barring rate based on the observable channel feedback. Our simulation results demonstrate that the DCMAB model performs better than benchmark schemes and remains close to the optimal latency confirming the effectiveness of our proposed scheme under changing UE traffic.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Internet of Things Journal
IEEE Internet of Things Journal Computer Science-Information Systems
CiteScore
17.60
自引率
13.20%
发文量
1982
期刊介绍: The EEE Internet of Things (IoT) Journal publishes articles and review articles covering various aspects of IoT, including IoT system architecture, IoT enabling technologies, IoT communication and networking protocols such as network coding, and IoT services and applications. Topics encompass IoT's impacts on sensor technologies, big data management, and future internet design for applications like smart cities and smart homes. Fields of interest include IoT architecture such as things-centric, data-centric, service-oriented IoT architecture; IoT enabling technologies and systematic integration such as sensor technologies, big sensor data management, and future Internet design for IoT; IoT services, applications, and test-beds such as IoT service middleware, IoT application programming interface (API), IoT application design, and IoT trials/experiments; IoT standardization activities and technology development in different standard development organizations (SDO) such as IEEE, IETF, ITU, 3GPP, ETSI, etc.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信