Hybrid-ARQ Based Relaying Strategies for Enhancing Reliability in Delay-Bounded Networks
Jaya Goel, J. Harshan

TL;DR
This paper proposes optimized hybrid-ARQ relaying strategies for delay-bounded networks, minimizing packet drop probability by intelligently distributing ARQs based on channel conditions and delay constraints.
Contribution
It introduces a novel approach to allocate ARQs optimally in CC-HARQ protocols considering channel fading scenarios, with closed-form PDP expressions and low-complexity algorithms.
Findings
Proposed CC-HARQ strategies outperform Type-1 ARQ in reliability.
Derived closed-form expressions for PDP under different fading conditions.
Developed low-complexity algorithms for near-optimal ARQ distribution.
Abstract
Inspired by several delay-bounded mission-critical applications, this paper investigates chase-combining-based hybrid automatic repeat request (CC-HARQ) protocols to achieve high reliability in delay-constrained applications. A salient feature of our approach is to use the end-to-end delay constraint for computing the total number of ARQs permitted in the network, and then optimally distributing them across the nodes so as to minimize packet-drop-probability (PDP), which is the end-to-end reliability metric of interest. Since the chase-combining strategy combines the received packets across multiple attempts, we observe that the PDP of the network depends on the coherence-time of the intermediate wireless channels. As a result, we address the question of computing optimal allocation of ARQs for CC-HARQ strategies under both slow-fading and fast-fading scenarios. For both the channel…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Interconnection Networks and Systems · Advanced Queuing Theory Analysis
