Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT
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 jo...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-08-01
|
| Series: | Sensors |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1424-8220/25/15/4846 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849239710812078080 |
|---|---|
| author | Yujie Zhao Tao Peng Yichen Guo Yijing Niu Wenbo Wang |
| author_facet | Yujie Zhao Tao Peng Yichen Guo Yijing Niu Wenbo Wang |
| author_sort | Yujie Zhao |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-20dcbfcfe73c47578ef6cb1b7ee60363 |
| institution | Kabale University |
| issn | 1424-8220 |
| language | English |
| publishDate | 2025-08-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Sensors |
| spelling | doaj-art-20dcbfcfe73c47578ef6cb1b7ee603632025-08-20T04:00:51ZengMDPI AGSensors1424-82202025-08-012515484610.3390/s25154846Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoTYujie Zhao0Tao Peng1Yichen Guo2Yijing Niu3Wenbo Wang4School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaSchool of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaSchool of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaSchool of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaSchool of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaIn 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.https://www.mdpi.com/1424-8220/25/15/4846uRLLCrelay-assisted communicationsfinite blocklengthresource consumption minimization |
| spellingShingle | Yujie Zhao Tao Peng Yichen Guo Yijing Niu Wenbo Wang Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT Sensors uRLLC relay-assisted communications finite blocklength resource consumption minimization |
| title | Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT |
| title_full | Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT |
| title_fullStr | Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT |
| title_full_unstemmed | Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT |
| title_short | Minimization of Resource Consumption with URLLC Constraints for Relay-Assisted IIoT |
| title_sort | minimization of resource consumption with urllc constraints for relay assisted iiot |
| topic | uRLLC relay-assisted communications finite blocklength resource consumption minimization |
| url | https://www.mdpi.com/1424-8220/25/15/4846 |
| work_keys_str_mv | AT yujiezhao minimizationofresourceconsumptionwithurllcconstraintsforrelayassistediiot AT taopeng minimizationofresourceconsumptionwithurllcconstraintsforrelayassistediiot AT yichenguo minimizationofresourceconsumptionwithurllcconstraintsforrelayassistediiot AT yijingniu minimizationofresourceconsumptionwithurllcconstraintsforrelayassistediiot AT wenbowang minimizationofresourceconsumptionwithurllcconstraintsforrelayassistediiot |