{"title":"有限码长全双工中继网络中传输延迟最小化","authors":"Boyao Li;Xiaopeng Yuan;Yulin Hu;Anke Schmeink","doi":"10.1109/JSAC.2025.3531543","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a multi-hop full-duplex (FD) relaying system that supports low-latency communication, and aim to explore the potential of FD technology in suppressing transmission latency. Specifically, we begin with a two-hop relaying system, where a source node is expected to transmit a large message to the destination node via a relaying node operating in FD mode. We assume the large message is equally divided into multiple smaller packets, while the whole transmission is operated in a packet-by-packet manner and retransmissions are scheduled against decoding failures. Notably, we have for the first time characterized the expected transmission latency while taking into account the finite blocklength (FBL) impact on transmission reliability. Through a proposed error probability propagation policy, we have recursively derived the expected number of transmissions required to successfully conveying the entire message via FD relaying system. An optimization problem is then formulated to minimize the expected transmission latency by jointly optimizing packet division, blocklength allocation, and transmit power control. To deal with the inherent nonconvexity of the problem, we reformulate it using variable substitution and subsequently construct a tight convex approximation based on an arbitrary feasible point. This facilitates an iterative algorithm that progressively refines the solution until convergence to a suboptimal point. The whole approach for latency characterization and minimization is then extended to the multi-hop relaying scenario. Finally, simulation results validate the convergence behaviours of our proposed algorithms and highlight the latency benefits of our solution compared to both half-duplex relaying and full-duplex relaying without optimal power control.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":"43 4","pages":"1168-1182"},"PeriodicalIF":0.0000,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transmission Latency Minimization in Full-Duplex Relaying Network Operating With Finite Blocklength Codes\",\"authors\":\"Boyao Li;Xiaopeng Yuan;Yulin Hu;Anke Schmeink\",\"doi\":\"10.1109/JSAC.2025.3531543\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider a multi-hop full-duplex (FD) relaying system that supports low-latency communication, and aim to explore the potential of FD technology in suppressing transmission latency. Specifically, we begin with a two-hop relaying system, where a source node is expected to transmit a large message to the destination node via a relaying node operating in FD mode. We assume the large message is equally divided into multiple smaller packets, while the whole transmission is operated in a packet-by-packet manner and retransmissions are scheduled against decoding failures. Notably, we have for the first time characterized the expected transmission latency while taking into account the finite blocklength (FBL) impact on transmission reliability. Through a proposed error probability propagation policy, we have recursively derived the expected number of transmissions required to successfully conveying the entire message via FD relaying system. An optimization problem is then formulated to minimize the expected transmission latency by jointly optimizing packet division, blocklength allocation, and transmit power control. To deal with the inherent nonconvexity of the problem, we reformulate it using variable substitution and subsequently construct a tight convex approximation based on an arbitrary feasible point. This facilitates an iterative algorithm that progressively refines the solution until convergence to a suboptimal point. The whole approach for latency characterization and minimization is then extended to the multi-hop relaying scenario. Finally, simulation results validate the convergence behaviours of our proposed algorithms and highlight the latency benefits of our solution compared to both half-duplex relaying and full-duplex relaying without optimal power control.\",\"PeriodicalId\":73294,\"journal\":{\"name\":\"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society\",\"volume\":\"43 4\",\"pages\":\"1168-1182\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2025-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10845804/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10845804/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Transmission Latency Minimization in Full-Duplex Relaying Network Operating With Finite Blocklength Codes
In this paper, we consider a multi-hop full-duplex (FD) relaying system that supports low-latency communication, and aim to explore the potential of FD technology in suppressing transmission latency. Specifically, we begin with a two-hop relaying system, where a source node is expected to transmit a large message to the destination node via a relaying node operating in FD mode. We assume the large message is equally divided into multiple smaller packets, while the whole transmission is operated in a packet-by-packet manner and retransmissions are scheduled against decoding failures. Notably, we have for the first time characterized the expected transmission latency while taking into account the finite blocklength (FBL) impact on transmission reliability. Through a proposed error probability propagation policy, we have recursively derived the expected number of transmissions required to successfully conveying the entire message via FD relaying system. An optimization problem is then formulated to minimize the expected transmission latency by jointly optimizing packet division, blocklength allocation, and transmit power control. To deal with the inherent nonconvexity of the problem, we reformulate it using variable substitution and subsequently construct a tight convex approximation based on an arbitrary feasible point. This facilitates an iterative algorithm that progressively refines the solution until convergence to a suboptimal point. The whole approach for latency characterization and minimization is then extended to the multi-hop relaying scenario. Finally, simulation results validate the convergence behaviours of our proposed algorithms and highlight the latency benefits of our solution compared to both half-duplex relaying and full-duplex relaying without optimal power control.