基于哈希函数的5G及以上网络高效接入RACH方案

S. Swain, Ashit Subudhi
{"title":"基于哈希函数的5G及以上网络高效接入RACH方案","authors":"S. Swain, Ashit Subudhi","doi":"10.1109/FNWF55208.2022.00022","DOIUrl":null,"url":null,"abstract":"With more subscribers and a variety in business use cases relying on 5G New Radio (NR) network infrastructure, the access network needs to be scalable. The initial network access procedure comprises of users sending preambles to gNB for granting uplink (UL) resources. However, limited preambles in 5G NR can be a bottleneck on the performance of network access procedures. Preamble collisions during initial Random Access Channel (RACH) procedure can limit the scalability of the network. With the increase in the number of cellular User Equipments (UEs) and Machine Type Communication (MTC) devices, the probability of such preamble collisions further increases, thereby leading to reattempts by UEs. This in turn, results in increased latency and reduced channel utilization. In this work, we have used hash functions for selecting preambles during the RACH process. We have used modulo hash functions to convert device identifiers into preamble indexes such that the collision is reduced. In order to counter collisions while using hash functions, we have adopted standard collision resolution techniques such as linear probing, quadratic probing, and double hashing. On performing extensive simulations, it is observed that the hashing based access scheme performs better than the standard Access Class Barring (ACB) scheme in effectively reducing the number of collisions thereby empowering more users to access the network.","PeriodicalId":300165,"journal":{"name":"2022 IEEE Future Networks World Forum (FNWF)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel RACH Scheme for Efficient Access in 5G and Beyond Networks using Hash Function\",\"authors\":\"S. Swain, Ashit Subudhi\",\"doi\":\"10.1109/FNWF55208.2022.00022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With more subscribers and a variety in business use cases relying on 5G New Radio (NR) network infrastructure, the access network needs to be scalable. The initial network access procedure comprises of users sending preambles to gNB for granting uplink (UL) resources. However, limited preambles in 5G NR can be a bottleneck on the performance of network access procedures. Preamble collisions during initial Random Access Channel (RACH) procedure can limit the scalability of the network. With the increase in the number of cellular User Equipments (UEs) and Machine Type Communication (MTC) devices, the probability of such preamble collisions further increases, thereby leading to reattempts by UEs. This in turn, results in increased latency and reduced channel utilization. In this work, we have used hash functions for selecting preambles during the RACH process. We have used modulo hash functions to convert device identifiers into preamble indexes such that the collision is reduced. In order to counter collisions while using hash functions, we have adopted standard collision resolution techniques such as linear probing, quadratic probing, and double hashing. On performing extensive simulations, it is observed that the hashing based access scheme performs better than the standard Access Class Barring (ACB) scheme in effectively reducing the number of collisions thereby empowering more users to access the network.\",\"PeriodicalId\":300165,\"journal\":{\"name\":\"2022 IEEE Future Networks World Forum (FNWF)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Future Networks World Forum (FNWF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FNWF55208.2022.00022\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Future Networks World Forum (FNWF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FNWF55208.2022.00022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着越来越多的用户和依赖5G新无线电(NR)网络基础设施的各种业务用例,接入网需要具有可扩展性。初始的网络接入过程包括用户向gNB发送序文,以授予UL (uplink)资源。然而,5G NR中有限的序数可能成为网络接入过程性能的瓶颈。随机接入信道(RACH)初始化过程中的前导冲突限制了网络的可扩展性。随着蜂窝用户设备(ue)和机器类型通信(MTC)设备数量的增加,这种前导冲突的可能性进一步增加,从而导致ue的重试。这反过来又会导致延迟增加和通道利用率降低。在这项工作中,我们在RACH过程中使用哈希函数来选择序曲。我们使用模哈希函数将设备标识符转换为前导索引,从而减少了冲突。为了在使用哈希函数时防止冲突,我们采用了标准的冲突解决技术,如线性探测、二次探测和双哈希。通过大量的仿真,观察到基于哈希的访问方案比标准的访问类限制(ACB)方案在有效减少冲突数量方面表现得更好,从而使更多的用户能够访问网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Novel RACH Scheme for Efficient Access in 5G and Beyond Networks using Hash Function
With more subscribers and a variety in business use cases relying on 5G New Radio (NR) network infrastructure, the access network needs to be scalable. The initial network access procedure comprises of users sending preambles to gNB for granting uplink (UL) resources. However, limited preambles in 5G NR can be a bottleneck on the performance of network access procedures. Preamble collisions during initial Random Access Channel (RACH) procedure can limit the scalability of the network. With the increase in the number of cellular User Equipments (UEs) and Machine Type Communication (MTC) devices, the probability of such preamble collisions further increases, thereby leading to reattempts by UEs. This in turn, results in increased latency and reduced channel utilization. In this work, we have used hash functions for selecting preambles during the RACH process. We have used modulo hash functions to convert device identifiers into preamble indexes such that the collision is reduced. In order to counter collisions while using hash functions, we have adopted standard collision resolution techniques such as linear probing, quadratic probing, and double hashing. On performing extensive simulations, it is observed that the hashing based access scheme performs better than the standard Access Class Barring (ACB) scheme in effectively reducing the number of collisions thereby empowering more users to access the network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SliceSecure: Impact and Detection of DoS/DDoS Attacks on 5G Network Slices A Score Function Heuristic for Crosstalk- and Fragmentation-Aware Dynamic Routing, Modulation, Core, and Spectrum Allocation in SDM-EONs Machine Learning Aided Design of Sub-Array MIMO Antennas for CubeSats Based on 3D Printed Metallic Ridge Gap Waveguides A Supra-Disciplinary Open Framework of Knowledge to Address the Future Challenges of a Network of Feelings Resource Allocation with Vickrey-Dutch Auctioning Game for C-RAN Fronthaul
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1