Broadcast scheduling for information distribution
Wireless Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Broadcast scheduling: algorithms and complexity
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Broadcasting with Side Information
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Path diversity for enhanced media streaming
IEEE Communications Magazine
Adaptive network coding for scheduling real-time traffic with hard deadlines
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Online XOR packet coding: Efficient single-hop wireless multicasting with low decoding delay
Computer Communications
Hi-index | 0.00 |
We consider the problem of minimizing delay when broadcasting over erasure channels with feedback. A sender wishes to communicate the same set of µ messages to several receivers over separate erasure channels. The sender can broadcast a single message or a combination (encoding) of messages at each timestep. Receivers provide feedback as to whether the transmission was received. If at some time step a receiver cannot identify a new message, delay is incurred. Our notion of delay is motivated by real-time applications that request progressively refined input, such as the successive refinement of an image encoded using multiple description coding. Our setup is novel because it combines coding techniques with feedback information to the end of minimizing delay. It allows Θ(µ) benefits as compared to previous approaches for offline algorithms, while feedback allows online algorithms to achieve smaller delay than online algorithms without feedback. Our main complexity results are that the offline minimization problem is NP-hard when the sender only schedules single messages and that the general problem remains NP-hard even when coding is allowed. However we show that coding does offer delay and complexity gains over scheduling. We also discuss online heuristics and evaluate their performance through simulations.