This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Open AccessArticle
Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT
by
Yujie Zhao
Yujie Zhao
,
Tao Peng
Tao Peng *,
Yichen Guo
Yichen Guo
,
Yijing Niu
Yijing Niu and
Wenbo Wang
Wenbo Wang
School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
*
Author to whom correspondence should be addressed.
Sensors 2025, 25(15), 4846; https://doi.org/10.3390/s25154846 (registering DOI)
Submission received: 4 July 2025
/
Revised: 2 August 2025
/
Accepted: 4 August 2025
/
Published: 6 August 2025
Abstract
In relay-assisted Industrial Internet of Things (IIoT) systems with ultra-reliable low-latency communication (uRLLC) requirements, finite blocklength coding imposes stringent resource constraints. In this work, the packet error probability (PEP) and blocklength allocation across two-hop links are jointly optimized to minimize total blocklength (resource consumption) while satisfying reliability, latency, and throughput requirements. The original multi-variable problem is decomposed into two tractable subproblems. In the first subproblem, for a fixed total blocklength, the achievable rate is maximized. A near-optimal PEP is first derived via theoretical analysis. Subsequently, theoretical analysis proves that blocklength must be optimized to equalize the achievable rates between the two hops to maximize system performance. Consequently, the closed-form solution to optimal blocklength allocation is derived. In the second subproblem, the total blocklength is minimized via a bisection search method. Simulation results show that by adopting near-optimal PEPs, our approach reduces computation time by two orders of magnitude while limiting the achievable rate loss to within 1% compared to the exhaustive search method. At peak rates, the hop with superior channel conditions requires fewer resources. Compared with three baseline algorithms, the proposed algorithm achieves average resource savings of 21.40%, 14.03%, and 17.18%, respectively.
Share and Cite
MDPI and ACS Style
Zhao, Y.; Peng, T.; Guo, Y.; Niu, Y.; Wang, W.
Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT. Sensors 2025, 25, 4846.
https://doi.org/10.3390/s25154846
AMA Style
Zhao Y, Peng T, Guo Y, Niu Y, Wang W.
Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT. Sensors. 2025; 25(15):4846.
https://doi.org/10.3390/s25154846
Chicago/Turabian Style
Zhao, Yujie, Tao Peng, Yichen Guo, Yijing Niu, and Wenbo Wang.
2025. "Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT" Sensors 25, no. 15: 4846.
https://doi.org/10.3390/s25154846
APA Style
Zhao, Y., Peng, T., Guo, Y., Niu, Y., & Wang, W.
(2025). Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT. Sensors, 25(15), 4846.
https://doi.org/10.3390/s25154846
Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details
here.
Article Metrics
Article Access Statistics
For more information on the journal statistics, click
here.
Multiple requests from the same IP address are counted as one view.