On the Available Receiver Side Information in Wireless Network Coding

Abstract

In this paper, we will analyze how different amount of receiver side information (RSI) available at the receivers of a broadcast channel will affect the overall network throughput. Two transmission schemes, namely random linear network coding (RLNC) and round robin scheduling (RRS), are considered. Taking into account the differing amount of RSI available at each receiver, closed-form expressions of network throughput and asymptotic throughput at high SNR are obtained for a broadcast channel. Our results show that the asymptotic throughput of RLNC is always no worse than RRS no matter how much RSI is available at each receiver. With a sum constraint for the overall arrival rate of receiver side information in the broadcast channel, we show that the the maximum throughput is achieved for RLNC if each receiver accumulates the same amount of RSI.