Index ARQ Protocol for Reliable Contents Distribution over Broadcast Channels

Takahiro OSHIMA; Tadashi WADAYAMA

doi:10.1587/transfun.E100.A.832

Index ARQ Protocol for Reliable Contents Distribution over Broadcast Channels

Takahiro OSHIMA, Tadashi WADAYAMA

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.3 pp.832-838

Publication Date: 2017/03/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E100.A.832

Type of Manuscript: PAPER

Category: Coding Theory

Authors

Takahiro OSHIMA
Nagoya Institute of Technology
Tadashi WADAYAMA
Nagoya Institute of Technology

Keyword

ARQ, index codes, contents distribution, broadcast channels

Cite this

Copy

Takahiro OSHIMA, Tadashi WADAYAMA, "Index ARQ Protocol for Reliable Contents Distribution over Broadcast Channels" in IEICE TRANSACTIONS on Fundamentals, vol. E100-A, no. 3, pp. 832-838, March 2017, doi: 10.1587/transfun.E100.A.832.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.832/_p

Copy

@ARTICLE{e100-a_3_832,
author={Takahiro OSHIMA, Tadashi WADAYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Index ARQ Protocol for Reliable Contents Distribution over Broadcast Channels},
year={2017},
volume={E100-A},
number={3},
pages={832-838},
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.},
keywords={},
doi={10.1587/transfun.E100.A.832},
ISSN={1745-1337},
month={March},}

Copy

TY - JOUR
TI - Index ARQ Protocol for Reliable Contents Distribution over Broadcast Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 832
EP - 838
AU - Takahiro OSHIMA
AU - Tadashi WADAYAMA
PY - 2017
DO - 10.1587/transfun.E100.A.832
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2017
AB - 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.
ER -