pith. sign in

arxiv: 2602.13311 · v2 · submitted 2026-02-10 · 💻 cs.NI

Resilient and Freshness-Aware Scheduling for Industrial Multi-Hop IAB Networks: A Packet Duplication Approach

Shuo Zhu , Siyu Lin , Zijing Wang , Qiao Ren , Xiaoheng Deng , Bo Ai This is my paper

Pith reviewed 2026-05-16 06:13 UTC · model grok-4.3

classification 💻 cs.NI
keywords packet duplicationAge of InformationmmWave IAB networksqueue stabilityLyapunov optimizationresilient schedulingindustrial controlmulti-hop networks
0
0 comments X

The pith

RFAS scheduling maintains over 95% packet delivery and strict queue stability in blockage-prone mmWave IAB networks by combining packet duplication with Lyapunov optimization to minimize Age of Information.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper targets the tension in industrial mmWave multi-hop IAB networks where moving obstacles cause blockages that break links, while real-time control needs both reliable delivery and fresh data. Packet duplication adds path diversity for reliability but doubles load and risks congestion, so the authors set up an optimization that minimizes average Age of Information subject to hard queue-stability constraints. They apply Lyapunov optimization to convert the long-term stochastic problem into solvable per-slot deterministic subproblems and introduce the RFAS algorithm to allocate resources while tracking freshness and resilience. Simulations in blockage-heavy settings show the approach keeps packet delivery above 95 percent, prevents buffer overflows that plague baselines, and cuts load imbalance by 19 percent under heavy traffic.

Core claim

Formulating the joint reliability-freshness objective as a stochastic optimization problem with queue-stability constraints, applying Lyapunov drift-plus-penalty to produce deterministic per-slot subproblems, and solving them with a freshness-aware scheduler that decides duplication and routing yields an algorithm that sustains packet delivery above 95 percent and enforces queue stability under finite buffers while lowering load imbalance by 19 percent in high-frequency scenarios.

What carries the argument

Lyapunov optimization that turns the infinite-horizon stochastic program into a sequence of per-slot deterministic problems whose solutions are computed by the RFAS scheduler, which selects paths and duplication levels while penalizing both AoI and queue backlog.

Load-bearing premise

The simulated blockage patterns, traffic arrivals, and hard buffer sizes are close enough to real industrial mmWave IAB conditions that the Lyapunov-derived decisions remain stable and near-optimal when transferred to the actual stochastic system.

What would settle it

A field trial or trace-driven test in which buffers overflow or packet delivery falls below 95 percent under the same traffic intensity and blockage statistics used in the simulations would show the stability and performance guarantees do not hold.

Figures

Figures reproduced from arXiv: 2602.13311 by Bo Ai, Qiao Ren, Shuo Zhu, Siyu Lin, Xiaoheng Deng, Zijing Wang.

Figure 1
Figure 1. Figure 1: System model of the resilient industrial IAB [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Simulation topology of the industrial IAB network. [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Reliability analysis: PDR performance under vary [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Industrial Performance evaluation showing QAS, [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
read the original abstract

In industrial millimeter-wave (mmWave) multi-hop Integrated Access and Backhaul (IAB) networks, dynamic blockages caused by moving obstacles pose a severe threat to robust and continuous networks. While Packet Duplication (PD) enhances reliability by path diversity, it inevitably doubles the traffic load, leading to severe congestion and degraded Age of Information (AoI). To navigate this reliability-congestion trade-off, we formulated an optimization problem in a multi-hop IAB scenario that minimizes the average AOI while satisfying strict queue stability constraints. We utilize Lyapunov optimization to transform the long-term stochastic optimization problem into tractable deterministic sub-problems. To solve these sub-problems efficiently, we propose a Resilient and Freshness-Aware Scheduling (RFAS) algorithm. Simulation results show that in blockage-prone environments, RFAS significantly outperforms baselines by maintaining a Packet Delivery Ratio (PDR) above 95\%. Crucially, it strictly guarantees queue stability under hard buffer constraints, whereas baselines suffer from buffer overflows. Furthermore, RFAS reduces the network load imbalance by 19\% compared to the baseline in high-frequency traffic scenarios. This confirms RFAS as a robust and sustainable solution for real-time industrial control loops.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript proposes a Resilient and Freshness-Aware Scheduling (RFAS) algorithm for multi-hop mmWave Integrated Access and Backhaul (IAB) networks in industrial settings. It formulates an optimization problem to minimize long-term average Age of Information (AoI) subject to strict queue stability constraints under hard buffer limits, while incorporating packet duplication for resilience against dynamic blockages. Lyapunov optimization is used to convert the stochastic problem into per-slot deterministic subproblems, which RFAS solves. Simulations in blockage-prone environments are reported to yield packet delivery ratios above 95%, strict queue stability without overflows (contrasted with baselines), and a 19% reduction in network load imbalance under high-frequency traffic.

Significance. If the stability guarantees and performance improvements are rigorously established, the work would offer a relevant contribution to scheduling in blockage-prone industrial mmWave IAB networks by balancing reliability via packet duplication against congestion and freshness (AoI). The Lyapunov-based transformation to tractable subproblems is a standard technique applied here to a multi-hop setting with hard buffers, which could inform practical designs for real-time control loops if the pathwise guarantees hold beyond mean-rate stability.

major comments (1)
  1. [Abstract] Abstract: The assertion that RFAS 'strictly guarantees queue stability under hard buffer constraints' (while baselines overflow) is not supported by the described Lyapunov drift-plus-penalty approach. Standard analysis yields only mean-rate stability or O(1/V) bounds on time-average queue length for some control parameter V, not pathwise guarantees that queue lengths remain below a finite buffer size B on every sample path under time-varying blockage processes. Without an explicit buffer-aware projection or admission control inside the per-slot solver, transient overflows remain possible even when the drift condition holds in expectation.
minor comments (1)
  1. [Abstract] Abstract: The performance claims (PDR above 95%, 19% load-imbalance reduction) would be strengthened by including at least a brief statement of key simulation parameters such as blockage model, buffer sizes, traffic intensities, number of Monte Carlo runs, and statistical validation method.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the detailed and constructive review. The comment on stability guarantees is well-taken and highlights an important distinction between mean-rate stability and pathwise bounds. We address it below and will revise the manuscript to ensure precise claims.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The assertion that RFAS 'strictly guarantees queue stability under hard buffer constraints' (while baselines overflow) is not supported by the described Lyapunov drift-plus-penalty approach. Standard analysis yields only mean-rate stability or O(1/V) bounds on time-average queue length for some control parameter V, not pathwise guarantees that queue lengths remain below a finite buffer size B on every sample path under time-varying blockage processes. Without an explicit buffer-aware projection or admission control inside the per-slot solver, transient overflows remain possible even when the drift condition holds in expectation.

    Authors: We agree that the standard Lyapunov drift-plus-penalty framework yields mean-rate stability (i.e., lim sup (1/t) sum E[Q(tau)] < infinity) and O(1/V) bounds on time-average queue length, not sample-path guarantees that Q(t) <= B for all t and all realizations. Our per-slot subproblem does not include an explicit projection or admission-control step that would enforce hard buffer limits on every path. In the simulations, RFAS exhibited no overflows while baselines did, but this remains an empirical observation rather than a theoretical pathwise guarantee. We will revise the abstract and the stability analysis section to state that RFAS achieves mean-rate stability with bounded average queue lengths under the Lyapunov framework, report the simulation results on buffer occupancy separately, and remove the phrasing 'strictly guarantees queue stability under hard buffer constraints.' revision: yes

Circularity Check

0 steps flagged

Standard Lyapunov transformation with no self-referential reduction

full rationale

The paper formulates a stochastic AoI minimization problem subject to queue stability, then applies the standard Lyapunov drift-plus-penalty method to obtain per-slot deterministic subproblems solved by the proposed RFAS heuristic. This transformation is a textbook technique whose output bounds are derived from the drift expression rather than being redefined in terms of the target metrics. Simulation claims (PDR >95 %, 19 % imbalance reduction, buffer stability) are presented as empirical outcomes under chosen blockage and traffic models; they do not reduce by construction to fitted parameters or self-citations. No quoted equation or step exhibits self-definition, fitted-input renaming, or load-bearing self-citation chains.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Review based on abstract only. The paper relies on standard assumptions from stochastic optimization and wireless networking literature. No new entities or free parameters are explicitly introduced in the abstract.

axioms (2)
  • standard math Lyapunov optimization transforms long-term stochastic optimization problems into tractable deterministic sub-problems
    Invoked to convert the AoI minimization problem with queue stability constraints.
  • domain assumption Packet duplication provides path diversity that improves reliability against dynamic blockages
    Core premise for using PD in mmWave IAB networks.

pith-pipeline@v0.9.0 · 5532 in / 1367 out tokens · 33233 ms · 2026-05-16T06:13:59.944995+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

  1. [1]

    Resilient-by-design: A resilience framework for future wireless networks,

    N. H. Mahmood, S. Samarakoon, P. Porambage, M. Bennis, and M. Latva-Aho, “Resilient-by-design: A resilience framework for future wireless networks,” IEEE Communications Magazine, vol. 63, no. 11, pp. 158–164, 2025

    work page 2025

  2. [2]

    User persistence in 5G/6G mmWave/Sub-THz systems with blockage: Does it pay off?

    E. Sopin, D. Moltchanov, A. Maslov, V. Begishev, A. Samuylov, K. Samouylov, and Y. Koucheryavy, “User persistence in 5G/6G mmWave/Sub-THz systems with blockage: Does it pay off?” IEEE Transactions on Wireless Communications, vol. 23, no. 10, pp. 14 864–14 878, 2024

    work page 2024

  3. [3]

    Packet duplication in dual connectivity enabled 5G wireless networks: Overview and challenges,

    A. Aijaz, “Packet duplication in dual connectivity enabled 5G wireless networks: Overview and challenges,” IEEE Communi- cations Standards Magazine, vol. 3, no. 3, pp. 20–28, 2019

    work page 2019

  4. [4]

    Reliability of load balancing and packet duplication in de- pendent diamond networks,

    Z. Ge, S. Jhansale, L. Jüschke, L. Wolf, and E. A. Jorswieck, “Reliability of load balancing and packet duplication in de- pendent diamond networks,” in 2025 IEEE 102nd Vehicular Technology Conference (VTC2025-Fall), 2025, pp. 1–6

    work page 2025

  5. [5]

    String stability of vehicle platoon with packet loss in NR-V2X,

    R. Ning, S. Lin, X. Wang, X. Zhang, W. Feng, and N. Zhang, “String stability of vehicle platoon with packet loss in NR-V2X,” Chinese Journal of Electronics, vol. 34, no. 2, pp. 683–697, 2025

    work page 2025

  6. [6]

    Freshness-aware en- ergy efficiency optimization for integrated access and backhaul networks,

    Y. Zhang, M. A. Kishk, and M.-S. Alouini, “Freshness-aware en- ergy efficiency optimization for integrated access and backhaul networks,” IEEE Transactions on Wireless Communications, vol. 23, no. 10, pp. 14 715–14 728, 2024

    work page 2024

  7. [7]

    An efficient frame aggregation scheme for relay-aided internet of things net- works with age of information constraints,

    J. Wang, J. Wang, J. Chen, L. Bai, and J. Choi, “An efficient frame aggregation scheme for relay-aided internet of things net- works with age of information constraints,” IEEE Transactions on Mobile Computing, vol. 24, no. 9, pp. 9141–9152, 2025

    work page 2025

  8. [8]

    Research on deterministic delay performance optimization of dual-mode communication metering network based on peak AoI violation probability,

    Z. Chen, Y. Yan, and Z. Zhou, “Research on deterministic delay performance optimization of dual-mode communication metering network based on peak AoI violation probability,” Acta Electronica Sinica, pp. 1–14, 1 2026

    work page 2026

  9. [9]

    Effective-capacity-based resource allocation for end-to-end multi-connectivity in 5G IAB networks,

    C. Huang, X. Wang, and X. Wang, “Effective-capacity-based resource allocation for end-to-end multi-connectivity in 5G IAB networks,” IEEE Transactions on Wireless Communications, vol. 21, no. 8, pp. 6302–6316, 2022

    work page 2022

  10. [10]

    Energy-efficient D2D-aided dual UA V data collection,

    Q. Huang, W. Wang, Z. Song, and N. Zhao, “Energy-efficient D2D-aided dual UA V data collection,” Chinese Journal of Electronics, vol. 34, no. 1, pp. 176–185, 2025

    work page 2025

  11. [11]

    A scalable communication model to realize integrated access and backhaul (IAB) in 5G,

    M. Shokrnezhad, S. Khorsandi, and T. Taleb, “A scalable communication model to realize integrated access and backhaul (IAB) in 5G,” in ICC 2023 - IEEE International Conference on Communications, 2023, pp. 1350–1356

    work page 2023

  12. [12]

    Q- learning based joint PC-5/Uu offloading strategy for C-V2X based vehicular edge computing system,

    W. Feng, S. Lin, J. Feng, Y. Li, F. Kong, and B. Ai, “Q- learning based joint PC-5/Uu offloading strategy for C-V2X based vehicular edge computing system,” Acta Electronica Sinica, vol. 52, no. 2, pp. 385–395, 2 2024

    work page 2024

  13. [13]

    Joint data sampling and link scheduling for age minimization in multihop cyber- physical systems,

    Z. Wang, X. Qin, B. Liu, and P. Zhang, “Joint data sampling and link scheduling for age minimization in multihop cyber- physical systems,” IEEE Wireless Communications Letters, vol. 8, no. 3, pp. 765–768, 2019

    work page 2019

  14. [14]

    Millimeter-wave mobile com- munications for 5G: Challenges and opportunities,

    F. Al-Ogaili and R. M. Shubair, “Millimeter-wave mobile com- munications for 5G: Challenges and opportunities,” in 2016 IEEE International Symposium on Antennas and Propagation (APSURSI), 2016, pp. 1003–1004

    work page 2016

  15. [15]

    Delay-based network utility maximization,

    M. J. Neely, “Delay-based network utility maximization,” IEEE/ACM Transactions on Networking, vol. 21, no. 1, pp. 41–54, 2013

    work page 2013

  16. [16]

    Study on channel model for frequencies from 0.5 to 100 GHz,

    3GPP, “Study on channel model for frequencies from 0.5 to 100 GHz,” 3rd Generation Partnership Project (3GPP), Tech. Rep. TR 38.901 V18.0.0, may 2024

    work page 2024

  17. [17]

    Delay- optimal back-pressure routing algorithm for multihop wireless networks,

    L. Hai, Q. Gao, J. Wang, H. Zhuang, and P. Wang, “Delay- optimal back-pressure routing algorithm for multihop wireless networks,” IEEE Transactions on Vehicular Technology, vol. 67, no. 3, pp. 2617–2630, 2018

    work page 2018