Index ARQ Protocol for Reliable Contents Distribution over Broadcast Channels

TL;DR

This paper introduces an index ARQ broadcast protocol leveraging index coding to efficiently and reliably transmit packets to multiple receivers, achieving near-optimal throughput with low decoding complexity and power consumption.

Contribution

It proposes a novel broadcast ARQ protocol based on index coding that simplifies decoding and improves throughput in packet erasure channels.

Findings

Achieves throughput close to ideal FEC for erasure probabilities below 0.1.

Low decoding complexity reduces power consumption at receivers.

Provides reliable content distribution with efficient retransmissions.

Abstract

In the present paper, we propose a broadcast ARQ protocol based on the concept of index coding. In the proposed scenario, a server wishes to transmit a finite sequence of packets to multiple receivers via a broadcast channel with packet erasures until all of the receivers successfully receive all of the packets. In the retransmission phase, the server produces a coded packet as a retransmitted packet based on the side-information sent from the receivers via feedback channels. A notable feature of the proposed protocol is that the decoding process at the receiver side has low decoding complexity because only a small number of addition operations are needed in order to recover an intended packet. This feature may be preferable for reducing the power consumption of receivers. The throughput performance of the proposed protocol is close to that of the ideal FEC throughput performance when the erasure probability is less than $0.1$. This implies that the proposed protocol provides almost optimal throughput performance in such a regime.