XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Adaptive network coding and scheduling for maximizing throughput in wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Codecast: a network-coding-based ad hoc multicast protocol
IEEE Wireless Communications
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks
IEEE Transactions on Information Theory
A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Latency is a critical concern in interactive or delay-sensitive services such as interactive IPTV and VoIP. This is especially so when using network coding as a means to conserve bandwidth in these bandwidth-hungry services. In practical network coding, packets are coded in batches and thus suffer a large average delay per packet when packets get decoded after the whole batch is received. A larger batch size, however, also gives the highest bandwidth savings. In this paper, we analyze the achievable upper and lower bounds of the average delay per packet as well as packet loss rates due to finite-sized queue in a multicast downlink transmission from the system and client perspectives. We validate our analysis with simulation results and characterize the queueing and transmission delays, and packet loss performance with respect to (i) the maximum size of a batch and (ii) packet arrival rates. We find that random linear coding is an upper bound in delay performance and other hybrid network coding method might achieve better delay gains.