Abstract-In an unreliable single-hop broadcast network setting, we investigate the throughput and decoding-delay performance of random linear network coding as a function of the coding window size and the network size. Our model consists of a source transmitting packets of a single flow to a set of users over independent time-correlated erasure channels. The source performs random linear network coding (RLNC) over (coding window size) packets and broadcasts them to the users. We note that the broadcast throughput of RLNC must vanish with increasing , for any fixed . Hence, in contrast to other works in the literature, we investigate how the coding window size must scale for increasing . Our analysis reveals that the coding window size of represents a phase transition rate, below which the throughput converges to zero, and above which, it converges to the broadcast capacity. Further, we characterize the asymptotic distribution of decoding delay and provide approximate expressions for the mean and variance of decoding delay for the scaling regime of . These asymptotic expressions reveal the impact of channel correlations on the throughput and delay performance of RLNC. We also show that how our analysis can be extended to other rateless block coding schemes such as the LT codes. Finally, we comment on the extension of our results to the cases of dependent channels across users and asymmetric channel model. Index Terms-Broadcast, delay analysis, erasure channel, network coding.
Swapna et al. in REF work on RLNC over k packets broadcasting to n users over independent time-correlated erasure channels.
Throughput-Delay Analysis of Random Linear Network Coding for Wireless Broadcasting
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Mathematics Computer Science