{"title":"Improving Uplink Transmissions for URLLC Communication in 5G NR","authors":"Sujeet Kumar, Veerendra Kumar Gautam, Sangeeta Sharma, Mukesh Giluka","doi":"10.1109/COMSNETS59351.2024.10426891","DOIUrl":null,"url":null,"abstract":"In the dynamic landscape of today's swiftly evolving industries, there exists a growing demand for cost-effective and time-efficient methodologies spanning diverse domains. This need is particularly pronounced when addressing the challenges of achieving low latency and ultra-reliable communication within the digital realm. The advancement of 5G and beyond networks is geared towards fulfilling these requirements. In the context of uplink transmissions, the implementation of dynamic scheduling introduces latency due to the associated signaling overhead between User Equipment (UE) and the Base Station (gNB). To counteract this challenge, 5G introduces the concept of Configured Grant (CG) for uplink transmissions. This entails pre-allocating radio resources to UEs, thereby obviating the necessity for resource requests for each individual transmission. However, the effective realization of CG hinges on the use of efficient scheduling algorithms. In this paper, we propose novel CG scheduling algorithms, namely Sorted-OFDMA and Best-MatchOFDMA, designed to enhance scheduling efficiency. Furthermore, we delve into an exploration of the impact that numerology and bandwidth exert on resource block allocation. This study also involves a comparative analysis of the performance exhibited by various scheduling algorithms.","PeriodicalId":518748,"journal":{"name":"2024 16th International Conference on COMmunication Systems & NETworkS (COMSNETS)","volume":"311 6","pages":"1160-1163"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2024 16th International Conference on COMmunication Systems & NETworkS (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS59351.2024.10426891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In the dynamic landscape of today's swiftly evolving industries, there exists a growing demand for cost-effective and time-efficient methodologies spanning diverse domains. This need is particularly pronounced when addressing the challenges of achieving low latency and ultra-reliable communication within the digital realm. The advancement of 5G and beyond networks is geared towards fulfilling these requirements. In the context of uplink transmissions, the implementation of dynamic scheduling introduces latency due to the associated signaling overhead between User Equipment (UE) and the Base Station (gNB). To counteract this challenge, 5G introduces the concept of Configured Grant (CG) for uplink transmissions. This entails pre-allocating radio resources to UEs, thereby obviating the necessity for resource requests for each individual transmission. However, the effective realization of CG hinges on the use of efficient scheduling algorithms. In this paper, we propose novel CG scheduling algorithms, namely Sorted-OFDMA and Best-MatchOFDMA, designed to enhance scheduling efficiency. Furthermore, we delve into an exploration of the impact that numerology and bandwidth exert on resource block allocation. This study also involves a comparative analysis of the performance exhibited by various scheduling algorithms.