Pith. sign in

REVIEW

Dynamic HARQ with Guaranteed Delay

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1911.01684 v1 pith:JZOS7QBN submitted 2019-11-05 cs.IT math.IT

classification cs.ITmath.IT
keywords harqproposedschemeconventionalfixedcomparedd-harqdelay
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools