{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T16:13:26Z","timestamp":1779293606159,"version":"3.51.4"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,6,29]],"date-time":"2024-06-29T00:00:00Z","timestamp":1719619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100030800","name":"ELLIIT","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100030800","id-type":"DOI","asserted-by":"crossref"}]},{"name":"SSF","award":["FUS21-0033"],"award-info":[{"award-number":["FUS21-0033"]}]},{"name":"Adaptive Software for the Heterogeneous Edge-Cloud Continuum"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2024,7,31]]},"abstract":"<jats:p>The fifth-generation (5G) technology standard in telecommunications is expected to support ultra-reliable low latency communication to enable real-time applications such as industrial automation and control. 5G configured grant (CG) scheduling features a pre-allocated periodicity-based scheduling approach, which reduces control signaling time and guarantees service quality. Although this enables 5G to support hard real-time periodic traffics, synthesizing the schedule efficiently and achieving high resource efficiency, while serving multiple communications, are still an open problem. In this work, we study the trade-off between scheduling flexibility and control overhead when performing CG scheduling. To address the CG scheduling problem, we first formulate it using satisfiability modulo theories (SMT) so that an SMT solver can be used to generate optimal solutions. To enhance scalability, we propose two heuristic approaches. The first one as the baseline, Co1, follows the basic idea of the 5G CG scheduling scheme that minimizes the control overhead. The second one, CoU, enables increased scheduling flexibility while considering the involved control overhead. The effectiveness and scalability of the proposed techniques and the superiority of CoU compared to Co1 have been evaluated using a large number of generated benchmarks as well as a realistic case study for industrial automation.<\/jats:p>","DOI":"10.1145\/3664621","type":"journal-article","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T11:28:12Z","timestamp":1716895692000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-Traffic Resource Optimization for Real-Time Applications with 5G Configured Grant Scheduling"],"prefix":"10.1145","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4647-2412","authenticated-orcid":false,"given":"Yungang","family":"Pan","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0732-9186","authenticated-orcid":false,"given":"Rouhollah","family":"Mahfouzi","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9572-1091","authenticated-orcid":false,"given":"Soheil","family":"Samii","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8621-3346","authenticated-orcid":false,"given":"Petru","family":"Eles","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5137-565X","authenticated-orcid":false,"given":"Zebo","family":"Peng","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, Link\u00f6ping University, Link\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,29]]},"reference":[{"key":"e_1_3_3_2_2","unstructured":"Dahlman Erik Parkvall Stefan Skold Johan. 2020. 5G NR: The next generation wireless access technology."},{"key":"e_1_3_3_3_2","volume-title":"Sep.","year":"2020","unstructured":"2020. Service requirements for cyber-physical control applications in vertical domains, document 3GPP. TS 22.104 V16.5.0, Sep. 2020."},{"key":"e_1_3_3_4_2","volume-title":"Dec.","year":"2021","unstructured":"2021. NR; Physical layer procedures for data, document 3GPP. TS 38.214 V16.8.0, Dec. 2021."},{"key":"e_1_3_3_5_2","volume-title":"Jul.","year":"2020","unstructured":"2020. Study on communication for automation in vertical domains, document 3GPP. TR 22.804 V16.3.0, Jul. 2020."},{"key":"e_1_3_3_6_2","volume-title":"Dec.","year":"2021","unstructured":"2021. NR; NR and NG-RAN overall description, document 3GPP. TS 38.300 V16.8.0, Dec. 2021."},{"key":"e_1_3_3_7_2","volume-title":"Dec.","year":"2021","unstructured":"2021. Radio Resource Control (RRC) protocol specification, document 3GPP. TS 38.331 V16.7.0, Dec. 2021."},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE56975.2023.10137103"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247842"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.23919\/WONS57325.2023.10062219"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.1127.00161"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/NGMAST.2014.48"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7249250"},{"key":"e_1_3_3_14_2","doi-asserted-by":"crossref","unstructured":"Afrin Nusrat Brown Jason Khan Jamil Y. 2022. A multi-service adaptive semi-persistent LTE uplink scheduler for low power M2M devices Future Internet 107.","DOI":"10.3390\/fi14040107"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.12.007"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761395"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2944719"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/WICOM.2007.710"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM46510.2021.9685475"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2907625"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3001180"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3018822"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00123-6"},{"key":"e_1_3_3_24_2","volume-title":"Proceedings of the International conference on Tools and Algorithms for the Construction and Analysis of Systems. 337\u2013340","author":"Moura","unstructured":"Moura, Leonardo de and Bj\u00f8rner, Nikolaj. 2008. Z3: An efficient SMT solver. In Proceedings of the International conference on Tools and Algorithms for the Construction and Analysis of Systems. 337\u2013340."},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-018-5615-7"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102594"},{"key":"e_1_3_3_27_2","volume-title":"LTE physical layer performance analysis","author":"Yang Wen-Bin","unstructured":"Yang, Wen-Bin, Souryal, Michael. 2014. LTE physical layer performance analysis. Vol. NISTIR 7986. US Department of Commerce, National Institute of Standards and Technology."},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP.2014.6992085"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664621","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3664621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:45Z","timestamp":1750291425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,29]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,7,31]]}},"alternative-id":["10.1145\/3664621"],"URL":"https:\/\/doi.org\/10.1145\/3664621","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,29]]},"assertion":[{"value":"2023-06-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-10","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}