Throughput and delay analysis on uncoded and coded wireless broadcast with hard deadline constraints

Authors:
Xiaohang Li;Chih-Chun Wang;Xiaojun Lin
Affiliations:
Center for Wireless Systems and Applications, School of ECE, Purdue University, West Lafayette, IN;Center for Wireless Systems and Applications, School of ECE, Purdue University, West Lafayette, IN;Center for Wireless Systems and Applications, School of ECE, Purdue University, West Lafayette, IN
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 6
Cited 1

An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
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
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory

Broadcasting delay-constrained traffic over unreliable wireless links with network coding

MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multimedia streaming applications have stringent QoS requirements. Typically each packet is associated with a packet delivery deadline. This work models and considers realtime streaming broadcast for stored-video over the downlink of a single cell. The broadcast capacity of the system subject to deadline constraints are derived for both uncoded and coded wireless broadcast schemes. Even under the deadline requirements, it is shown in this work that network coding is asymptotically throughput-optimal and can strictly outperform the best noncoding policy by analytically quantifying the optimal capacity when the file size is sufficiently large. A simple network coding policy is also proposed that achieves the asymptotic capacity while maintaining finite transmission delay (queueing + decoding delay). A new temporal-queue-length-based Lyapunov function is used to prove the optimality of this policy. Simulation shows that the simple coding policy outperforms the best non-coding policies even for broadcasting files of small sizes.