An Analytical Model for Perpetual Network Codes in Packet Erasure Channels

TY - GEN

T1 - An Analytical Model for Perpetual Network Codes in Packet Erasure Channels

AU - Pahlevani, Peyman

AU - Crisostomo, Sergio

AU - Lucani Rötter, Daniel Enrique

PY - 2016/12/20

Y1 - 2016/12/20

N2 - Perpetual codes provide a sparse, but structured coding for fast encoding and decoding. In this work, we illustrate that perpetual codes introduce linear dependent packet transmissions in the presence of an erasure channel. We demonstrate that the number of linear dependent packet transmissions is highly dependent on a parameter called the width (ω), which represents the number of consecutive non-zero coding coefficient present in each coded packet after a pivot element. We provide a mathematical analysis based on the width of the coding vector for the number of transmitted packets and validate it with simulation results. The simulations show that for ω = 5, generation size g = 256, and low erasure probability on the link, a destination can receive up to 70% overhead in average. Moreover, increasing the width, the overhead contracts, and for ω ≥ 60 it becomes negligible.

AB - Perpetual codes provide a sparse, but structured coding for fast encoding and decoding. In this work, we illustrate that perpetual codes introduce linear dependent packet transmissions in the presence of an erasure channel. We demonstrate that the number of linear dependent packet transmissions is highly dependent on a parameter called the width (ω), which represents the number of consecutive non-zero coding coefficient present in each coded packet after a pivot element. We provide a mathematical analysis based on the width of the coding vector for the number of transmitted packets and validate it with simulation results. The simulations show that for ω = 5, generation size g = 256, and low erasure probability on the link, a destination can receive up to 70% overhead in average. Moreover, increasing the width, the overhead contracts, and for ω ≥ 60 it becomes negligible.

UR - http://www.scopus.com/inward/record.url?scp=85009471398&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-51376-8_10

DO - 10.1007/978-3-319-51376-8_10

M3 - Article in proceedings

SN - 978-3-319-51375-1

VL - 10121

T3 - Lecture Notes in Computer Science

SP - 126

EP - 135

BT - Multiple Access Communications - 9th International Workshop, MACOM 2016, Proceedings

PB - Springer

T2 - 9th International Workshop on Multiple Access Communications

Y2 - 21 November 2016 through 22 November 2016

ER -