Dynamic HARQ with Guaranteed Delay

TL;DR

This paper introduces a dynamic HARQ scheme that adaptively adjusts retransmissions based on previous packet success, ensuring delay guarantees and improving throughput in delay-sensitive, channel state information-limited scenarios.

Contribution

The paper proposes a novel D-HARQ scheme with dynamic retransmission control and analyzes its performance using a Markov model, demonstrating superior delay and throughput performance.

Findings

D-HARQ outperforms conventional HARQ in delay-sensitive applications.

D-HARQ achieves higher throughput under the same reliability constraints.

The scheme is effective without channel state information at the transmitter.

Abstract

In this paper, a dynamic-hybrid automatic repeat request (D-HARQ) scheme with guaranteed delay performance is proposed. As opposed to the conventional HARQ that the maximum number of re-transmissions, L, is fixed, in the proposed scheme packets can be retransmitted more times given that the previous packet was received with less than L re-transmissions. The dynamic of the proposed scheme is analyzed using the Markov model. For delay-sensitive applications, the proposed scheme shows superior performance in terms of packet error rate compared with the conventional HARQ and Fixed re-transmission schemes when the channel state information is not available at the transmitter. We further show that D-HARQ achieves a higher throughput compared with the conventional HARQ and fixed re-transmission schemes under the same reliability constraint.