Scheduling for network coded multicast: A conflict graph formulation

Danail Traskov, Michael Heindlmaie, Muriel Médard, Ralf Koetter, Desmond S. Lun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

28 Scopus citations

Abstract

Consider network coded multicast traffic over a wireless network in the bandwidth limited regime. We formulate the joint medium access and subgraph optimization problem by means of a graphical conflict model. The nature of network coded flows is not captured by classical link-based scheduling and therefore requires a novel approach based on conflicting hyperarcs. By means of simulations, we evaluate the performance of our algorithm and conclude that it significantly outperforms existing scheduling techniques

Original languageEnglish (US)
Title of host publication2008 IEEE Globecom Workshops, GLOBECOM 2008
DOIs
StatePublished - 2008
Externally publishedYes
Event2008 IEEE Globecom Workshops, GLOBECOM 2008 - New Orleans, LA, United States
Duration: Nov 30 2008Dec 4 2008

Publication series

Name2008 IEEE Globecom Workshops, GLOBECOM 2008

Other

Other2008 IEEE Globecom Workshops, GLOBECOM 2008
Country/TerritoryUnited States
CityNew Orleans, LA
Period11/30/0812/4/08

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Fingerprint

Dive into the research topics of 'Scheduling for network coded multicast: A conflict graph formulation'. Together they form a unique fingerprint.

Cite this