Scheduling for network coded multicast: a distributed approach
Author(s)
Heindlmaier, Michael; Traskov, Danail; Koetter, Ralf; Medard, Muriel
DownloadHeindlmaier-2009-Scheduling for network coded multicast a distributed approach.pdf (165.2Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
We address the problem of maximizing the throughput for network coded multicast traffic in a wireless network in the bandwidth limited regime. For the joint scheduling and subgraph selection problem, we model valid network configurations as stable sets in an appropriately defined conflict graph. The problem formulation separates the combinatorial difficulty of scheduling from the arising optimization problem and facilitates the application of less complex scheduling policies. Lagrangian relaxation gives rise to two subproblems, a multiple shortest path, and a maximum weight stable set (MWSS) problem. For the latter we propose a greedy approach which can be computed in a distributed fashion, thus yielding a fully decentralized algorithm. Simulation results show that our technique is nearly optimal and outperforms heuristics such as orthogonal scheduling by a large margin.
Date issued
2009-12Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of ElectronicsJournal
2009 IEEE GLOBECOM Workshops
Publisher
Institute of Electrical and Electronics Engineers
Citation
Heindlmaier, M. et al. “Scheduling for Network Coded Multicast: A Distributed Approach.” GLOBECOM Workshops, 2009 IEEE. 2009. 1-6. © Copyright 2010 IEEE
Version: Final published version
Other identifiers
INSPEC Accession Number: 11036762
ISBN
978-1-4244-5626-0