Joint scheduling and instantaneously decodable network coding

Authors:
Danail Traskov;Muriel Médard;Parastoo Sadeghi;Ralf Koetter
Affiliations:
Institute for Communications Engineering, Technical University Munich, Germany;Research Laboratory of Electronics, Massachusetts Institute of Technology;Research School of Information Sciences and Engineering, The Australian National University, Australia;-
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 6
Cited 1

An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Minimum-cost multicast over coded packet networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
XORs in the air: practical wireless network coding

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
Insufficiency of linear coding in network information flow

IEEE Transactions on Information Theory
On Joint MAC and Network Coding in Wireless Ad Hoc Networks

IEEE Transactions on Information Theory

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across different users, however with the restriction that packets have to be decoded after one hop. We compute the stability region of this scheme and propose an online algorithm that stabilizes every arrival rate vector within the stability region. The online algorithm requires computation of stable sets in an appropriately defined conflict graph. We show by means of simulations that this inherently hard problem is tractable for some instances and that network coding extends the stability region over routing and leads, on average, to a smaller backlog.