Contention-Free Configured Grant Scheduling for 5G URLLC Traffic

5G networks are being designed to support ultra reliable and low latency communication (URLLC) services in many real-time industrial applications. The conventional grant-based dynamic scheduling can hardly fulfill the URLLC requirements due to the non-negligible transmission delays introduced during...

Full description

Saved in:
Bibliographic Details
Published in:2023 60th ACM/IEEE Design Automation Conference (DAC) pp. 1 - 6
Main Authors: Zhang, Tianyu, Hu, Xiaobo Sharon, Han, Song
Format: Conference Proceeding
Language:English
Published: IEEE 09.07.2023
Subjects:
5G mobile communication
Dynamic scheduling
Heuristic algorithms
Job shop scheduling
Reliability engineering
Scalability
Ultra reliable low latency communication
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 5G networks are being designed to support ultra reliable and low latency communication (URLLC) services in many real-time industrial applications. The conventional grant-based dynamic scheduling can hardly fulfill the URLLC requirements due to the non-negligible transmission delays introduced during the spectrum resource grant process. To address this problem, 5G defines a grant-free transmission scheme, namely configured grant (CG) scheduling, for uplink (UL) traffic to pre-allocate spectrum resource to user equipments (UEs). This paper studies CG scheduling for periodic URLLC traffic with real-time and collision-free guarantees. An exact solution based on Satisfiability Modulo Theory (SMT) is first proposed to generate a feasible CG configuration for a given traffic set. To enhance scalability, we further develop an efficient graph-based heuristic consisting of an offset selection method and a multicoloring algorithm for spectrum resource allocation. Extensive experiments are conducted using 3GPP industrial use cases to show that both approaches can satisfy the real-time and collision-free requirements, and the heuristic can achieve comparable schedulability ratio with the SMT-based approach but require significantly lower running time.
AbstractList 5G networks are being designed to support ultra reliable and low latency communication (URLLC) services in many real-time industrial applications. The conventional grant-based dynamic scheduling can hardly fulfill the URLLC requirements due to the non-negligible transmission delays introduced during the spectrum resource grant process. To address this problem, 5G defines a grant-free transmission scheme, namely configured grant (CG) scheduling, for uplink (UL) traffic to pre-allocate spectrum resource to user equipments (UEs). This paper studies CG scheduling for periodic URLLC traffic with real-time and collision-free guarantees. An exact solution based on Satisfiability Modulo Theory (SMT) is first proposed to generate a feasible CG configuration for a given traffic set. To enhance scalability, we further develop an efficient graph-based heuristic consisting of an offset selection method and a multicoloring algorithm for spectrum resource allocation. Extensive experiments are conducted using 3GPP industrial use cases to show that both approaches can satisfy the real-time and collision-free requirements, and the heuristic can achieve comparable schedulability ratio with the SMT-based approach but require significantly lower running time.
Author Han, Song
Zhang, Tianyu
Hu, Xiaobo Sharon
Author_xml – sequence: 1
  givenname: Tianyu
  surname: Zhang
  fullname: Zhang, Tianyu
  organization: University of Connecticut,Dept. of Computer Science and Engineering
– sequence: 2
  givenname: Xiaobo Sharon
  surname: Hu
  fullname: Hu, Xiaobo Sharon
  organization: University of Notre Dame,Dept. of Computer Science and Engineering
– sequence: 3
  givenname: Song
  surname: Han
  fullname: Han, Song
  organization: University of Connecticut,Dept. of Computer Science and Engineering
BookMark eNo1j8tKw0AYRkdQUGveQGReIHHul50l2igEBG3XZW5_HagTmaYL396Cuvo4cDjwXaPzMpWE0B0lHaXE3j8ue6kssx0jjHeUMKGNYGeosdoaLglnXBh6iZrDIXuiiDSCKHGFHvqpzKnMeSrtqqaETwx5d6wp4qG6MuP38JHicZ_LDsNUsRzw5m0ce7yuDiCHG3QBbn9Izd8u0Gb1tO6f2_F1eOmXY-uYJXN7cpn1QUZDtXOSUjBeAYs2Wp2khgCBMSuEVJ7TELWXlmoJFJSTXoPiC3T7280ppe1XzZ-ufm__j_IfK2VKkw
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/DAC56929.2023.10247842
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9798350323481
EndPage 6
ExternalDocumentID 10247842
Genre orig-research
GrantInformation_xml – fundername: National Science Foundation
  funderid: 10.13039/100000001
GroupedDBID 6IE
6IH
ACM
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIE
RIO
ID FETCH-LOGICAL-a290t-aff29bc5d817aa511f8b6f2d9d97e57fcfc2294456b31cd7b59175f1f6a5b7f63
IEDL.DBID RIE
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001073487300156&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:51:00 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a290t-aff29bc5d817aa511f8b6f2d9d97e57fcfc2294456b31cd7b59175f1f6a5b7f63
PageCount 6
ParticipantIDs ieee_primary_10247842
PublicationCentury 2000
PublicationDate 2023-July-9
PublicationDateYYYYMMDD 2023-07-09
PublicationDate_xml – month: 07
  year: 2023
  text: 2023-July-9
  day: 09
PublicationDecade 2020
PublicationTitle 2023 60th ACM/IEEE Design Automation Conference (DAC)
PublicationTitleAbbrev DAC
PublicationYear 2023
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib060584064
Score 2.2660084
Snippet 5G networks are being designed to support ultra reliable and low latency communication (URLLC) services in many real-time industrial applications. The...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms 5G mobile communication
Dynamic scheduling
Heuristic algorithms
Job shop scheduling
Reliability engineering
Scalability
Ultra reliable low latency communication
Title Contention-Free Configured Grant Scheduling for 5G URLLC Traffic
URI https://ieeexplore.ieee.org/document/10247842
WOSCitedRecordID wos001073487300156&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG6UePCkRozv9OC12O222_amQcEDIUTFcCN9Ei5g1sXf77SAxoMHb00faaavb9rON4PQDVxwCumVIIVUlnBn4RyMLBCqPDPWUWfzO-TbQA6HajLRow1ZPXNhQgjZ-Cx0UjL_5fulW6WnMtjhjEvF4cTdlbJak7W2iyd97wE48Q0LuKD69uG-KyqA_04KEd7ZNv4VRiWjSO_gn_0fovYPHw-PvpHmCO2ExTG6y46lsrEi6dUh4FR5PlvVweM-IFCDX2BCfLI0n2FQTbHo4_HzYNDFgE_JcUQbjXuPr90nsomHQAzTtCFQxrR1wqtCGgOaUlS2isxrr2UQMrroGNMcVCJbFs5LK-AuJmIRKyOsjFV5glqL5SKcIgxyVELTYKignGumTOl16bgH1IqgFZyhdhJ_-r52eTHdSn7-R_4F2k-DnO1Y9SVqNfUqXKE999nMP-rrPFFfE_KSFg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8MgFCZGTfSkxhl_y8FrJ6VQ4KaZbjPWZdHN7LaUX8sum6mdf78Ptmk8ePBGSkn6oPB9wPveQ-gaNjipsJInqZA6YUbDOuipS4i0tNSGGB3PId8K0evJ0Uj1V2L1qIVxzkXnM9cMxXiXb-dmEY7KYIZTJiSDFXeLM0bJUq61_n3CBR_AE1vpgFOibu7vWjwHAtAMScKb6-a_EqlEHGnv_fML9lHjR5GH-99Yc4A23OwQ3cbQUtFdMWlXzuHw8nSyqJzFHcCgGr_CkNjgaz7BQE4x7-DhS1G0MCBUCB3RQMP2w6DVTVYZEZKSKlInUEeVNtzKVJQlcCUvde6pVVYJx4U33lCqGJAinaXGCs1hN8Z96vOSa-Hz7AhtzuYzd4ww2JFzRVxJOGFMUVlmVmWGWcAtD7zgBDWC-eP3ZdCL8dry0z-eX6Gd7uC5GBePvacztBs6PHq1qnO0WVcLd4G2zWc9_agu46B9AeHOlV0
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2023+60th+ACM%2FIEEE+Design+Automation+Conference+%28DAC%29&rft.atitle=Contention-Free+Configured+Grant+Scheduling+for+5G+URLLC+Traffic&rft.au=Zhang%2C+Tianyu&rft.au=Hu%2C+Xiaobo+Sharon&rft.au=Han%2C+Song&rft.date=2023-07-09&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FDAC56929.2023.10247842&rft.externalDocID=10247842