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!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1424-8220 |