{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:21:22Z","timestamp":1760145682831,"version":"build-2065373602"},"reference-count":38,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T00:00:00Z","timestamp":1724716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["62401140"],"award-info":[{"award-number":["62401140"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Network"],"abstract":"<jats:p>Ensuring high reliability and low latency poses challenges for numerous applications that require rigid performance guarantees, such as industrial automation and autonomous vehicles. Our research primarily concentrates on addressing the real-time requirements of ultra-reliable low-latency communication (URLLC). Specifically, we tackle the challenge of hard delay constraints in real-time transmission systems, overcoming this obstacle through a finite blocklength coding scheme. In the physical layer, we encode randomly arriving packets using a variable-length coding scheme and transmit the encoded symbols by truncated channel inversion over parallel channels. In the network layer, we model the encoding and transmission processes as tandem queues. These queues backlog the data bits waiting to be encoded and the encoded symbols to be transmitted, respectively. This way, we represent the system as a two-dimensional Markov chain. By focusing on instances when the symbol queue is empty, we simplify the Markov chain into a one-dimensional Markov chain, with the packet queue being the system state. This approach allows us to analytically express power consumption and formulate a power minimization problem under hard delay constraints. Finally, we propose a heuristic algorithm to solve the problem and provide an extensive evaluation of the trade-offs between the hard delay constraint and power consumption.<\/jats:p>","DOI":"10.3390\/network4030017","type":"journal-article","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T09:26:51Z","timestamp":1724750811000},"page":"367-389","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Framing and Power Allocation for Real-Time Wireless Networks with Variable-Length Coding: A Tandem Queue Approach"],"prefix":"10.3390","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8182-8752","authenticated-orcid":false,"given":"Yuanrui","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Electronic Engineering, Tsinghua University, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6911-6683","authenticated-orcid":false,"given":"Xiaoyu","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Southeast University, Nanjing 210018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9066-1448","authenticated-orcid":false,"given":"Wei","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering, Tsinghua University, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7304-6849","authenticated-orcid":false,"given":"Ying-Jun Angela","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, The Chinese University of Hong Kong, N.T., Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,8,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/MNET.001.1900287","article-title":"A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problems","volume":"34","author":"Saad","year":"2019","journal-title":"IEEE Netw."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1109\/JPROC.2022.3190205","article-title":"A Perspective on Time Toward Wireless 6G","volume":"110","author":"Popovski","year":"2022","journal-title":"Proc. IEEE"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1109\/JPROC.2016.2537298","article-title":"Toward Massive, Ultrareliable, and Low-Latency Wireless Communication With Short Packets","volume":"104","author":"Durisi","year":"2016","journal-title":"Proc. IEEE"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1109\/TIT.2016.2619717","article-title":"Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast","volume":"63","author":"Wang","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1866","DOI":"10.1109\/T-WC.2008.080037","article-title":"Energy-efficient scheduling of delay constrained traffic over fading channels","volume":"8","author":"Lee","year":"2009","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2107","DOI":"10.1109\/JSAC.2023.3280969","article-title":"Diversity Enabled Low-Latency Wireless Communications with Hard Delay Constraints","volume":"41","author":"Li","year":"2023","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"3371","DOI":"10.1109\/TIT.2011.2132510","article-title":"On Optimal Power Control for Delay-Constrained Communication over Fading Channels","volume":"57","author":"Li","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"6556","DOI":"10.1109\/TIT.2012.2204031","article-title":"Optimal Dynamic Coding-Window Selection for Serving Deadline-Constrained Traffic over Time-Varying Channels","volume":"58","author":"Li","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s11134-012-9293-y","article-title":"Queueing systems with hard delay constraints: A framework for real-time communication over unreliable wireless channels","volume":"71","author":"Hou","year":"2012","journal-title":"Queueing Syst."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Singh, R., Hou, I.H., and Kumar, P.R. (May, January 27). Fluctuation analysis of debt based policies for wireless networks with hard delay constraints. Proceedings of the IEEE INFOCOM 2014\u2014IEEE Conference on Computer Communications, Toronto, ON, Canada.","DOI":"10.1109\/INFOCOM.2014.6848185"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1109\/TCOMM.1994.580218","article-title":"On the ability of establishing real-time channels in point-to-point packet-switched networks","volume":"42","author":"Zheng","year":"1994","journal-title":"IEEE Trans. Commun."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2355","DOI":"10.1109\/TVT.2015.2425951","article-title":"Throughput Optimization in Multichannel Cognitive Radios With Hard-Deadline Constraints","volume":"65","author":"Ewaisha","year":"2016","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"3474","DOI":"10.1109\/TWC.2012.090312.110938","article-title":"Energy-Efficient Deadline-Constrained Maximum Reliability Forwarding in Lossy Networks","volume":"11","author":"Zou","year":"2012","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2093","DOI":"10.1109\/TWC.2021.3109427","article-title":"Joint Scheduling and Power Optimization for Delay Constrained Transmissions in Coded Caching over Wireless Fading Channels","volume":"21","author":"Liu","year":"2021","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2868","DOI":"10.1109\/TMC.2018.2815533","article-title":"Resource Sharing of a Computing Access Point for Multi-User Mobile Cloud Offloading with Delay Constraints","volume":"17","author":"Chen","year":"2018","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1109\/JSAC.2012.120514","article-title":"On Maximizing Delay-Constrained Coverage of Urban Vehicular Networks","volume":"30","author":"Zhu","year":"2012","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2307","DOI":"10.1109\/TIT.2010.2043769","article-title":"Channel Coding Rate in the Finite Blocklength Regime","volume":"56","author":"Polyanskiy","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Yang, W., Durisi, G., Koch, T., and Polyanskiy, Y. (2013, January 27\u201330). Block-Fading Channels at Finite Blocklength. Proceedings of the IEEE International Symposium on Wireless Communication Systems, Ilmenau, Germany.","DOI":"10.1109\/ISIT.2013.6620483"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"4232","DOI":"10.1109\/TIT.2014.2318726","article-title":"Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength","volume":"60","author":"Yang","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/TIT.2018.2860979","article-title":"Coherent Multiple-Antenna Block-Fading Channels at Finite Blocklength","volume":"65","author":"Collins","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"7184","DOI":"10.1109\/TCOMM.2020.3017757","article-title":"Resource Allocation for Multi-User Downlink MISO OFDMA-URLLC Systems","volume":"68","author":"Ghanem","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"2048","DOI":"10.1109\/TCOMM.2017.2666791","article-title":"Downlink Transmission of Short Packets: Framing and Control Information Revisited","volume":"65","author":"Trillingsgaard","year":"2017","journal-title":"IEEE Trans. Commun."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"4550","DOI":"10.1109\/TWC.2018.2827368","article-title":"Short-Packet Downlink Transmission with Non-Orthogonal Multiple Access","volume":"17","author":"Sun","year":"2018","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TWC.2018.2878713","article-title":"Fast HARQ over Finite Blocklength Codes: A Technique for Low-Latency Reliable Communication","volume":"18","author":"Makki","year":"2018","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1109\/MCOM.2018.1800181","article-title":"Short Block-Length Codes for Ultra-Reliable Low Latency Communications","volume":"57","author":"Shirvanimoghaddam","year":"2018","journal-title":"IEEE Commun. Mag."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"6854","DOI":"10.1109\/TIT.2016.2616900","article-title":"Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations","volume":"62","author":"Erseghe","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"4450","DOI":"10.1109\/TWC.2021.3130269","article-title":"Adaptive Finite Blocklength for Ultra-Low Latency in Wireless Communications","volume":"21","author":"Cheng","year":"2021","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"5892","DOI":"10.1109\/TCOMM.2019.2919637","article-title":"Throughput-Delay Tradeoffs with Finite Blocklength Coding over Multiple Coherence Blocks","volume":"67","author":"Qiao","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"3093","DOI":"10.1109\/TVT.2020.2968463","article-title":"Throughput Analysis of Low-Latency IoT Systems with QoS Constraints and Finite Blocklength Codes","volume":"69","author":"Hu","year":"2020","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1109\/LWC.2020.3046507","article-title":"Resource Allocation and Blocklength Selection for Low-Latency Vehicular Communications","volume":"10","author":"Fu","year":"2021","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"12333","DOI":"10.1109\/TVT.2022.3191085","article-title":"Rate-Splitting Multiple Access with Finite Blocklength for Short-Packet and Low-Latency Downlink Communications","volume":"71","author":"Xu","year":"2022","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"12782","DOI":"10.1109\/TVT.2021.3120145","article-title":"Multi-Device Low-Latency IoT Networks with Blind Retransmissions in the Finite Blocklength Regime","volume":"70","author":"He","year":"2021","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/LWC.2018.2860017","article-title":"Finite Block-Length Analysis of Large-But-Finite MIMO Systems","volume":"8","author":"Makki","year":"2019","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"6317","DOI":"10.1109\/TCOMM.2020.3009260","article-title":"Finite Blocklength Analysis of Multiple Access Channels with\/without Cooperation","volume":"68","author":"Kourtellaris","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1109\/JSAC.2013.131133","article-title":"Throughput of Cognitive Radio Systems with Finite Blocklength Codes","volume":"31","author":"Ozcan","year":"2013","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"2389","DOI":"10.1109\/TCOMM.2015.2429583","article-title":"Variable-Length Convolutional Coding for Short Blocklengths with Decision Feedback","volume":"63","author":"Williamson","year":"2015","journal-title":"IEEE Trans. Commun."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhao, X., Chen, W., and Zhang, Y.J.A. (2022, January 4\u20138). A Buffer-Aware Finite Blocklength Coding Scheme for Low-Latency Energy-Efficient Communications. Proceedings of the GLOBECOM 2022\u20142022 IEEE Global Communications Conference, Rio de Janeiro, Brazil.","DOI":"10.1109\/GLOBECOM48099.2022.10001696"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1834","DOI":"10.1109\/JPROC.2018.2867029","article-title":"Ultrareliable and Low-Latency Wireless Communication: Tail, Risk, and Scale","volume":"106","author":"Bennis","year":"2018","journal-title":"Proc. IEEE"}],"container-title":["Network"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2673-8732\/4\/3\/17\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:43:25Z","timestamp":1760111005000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2673-8732\/4\/3\/17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,27]]},"references-count":38,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["network4030017"],"URL":"https:\/\/doi.org\/10.3390\/network4030017","relation":{},"ISSN":["2673-8732"],"issn-type":[{"type":"electronic","value":"2673-8732"}],"subject":[],"published":{"date-parts":[[2024,8,27]]}}}