Joint scheduling and instantaneously decodable network coding

Simple item page
dc.contributor.authorTraskov, Danail
dc.contributor.authorMedard, Muriel
dc.contributor.authorSadeghi, Parastoo
dc.contributor.authorKoetter, Ralf
dc.coverage.spatialHawaii USA
dc.date.accessioned2015-12-07T22:38:43Z
dc.date.createdNovember 30-December 4 2009
dc.date.issued2009
dc.date.updated2016-02-24T11:20:37Z
dc.description.abstractWe 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.
dc.identifier.isbn9781424441488
dc.identifier.urihttp://hdl.handle.net/1885/23550
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE Inc)
dc.relation.ispartofseriesIEEE Global Communications Conference, Exhibition & Industry Forum (GLOBECOM 2009)
dc.sourceProceedings of IEEE Global Communications Conference, Exhibition & Industry Forum (GLOBECOM 2009)
dc.subjectKeywords: Arrival rates; Conflict graph; Hard problems; Joint scheduling; Network coding; On-line algorithms; Optimal scheduling; Packet transmissions; Stability regions; Stable sets; Wireless multi-hop network; Computation theory; Computer simulation; Information
dc.titleJoint scheduling and instantaneously decodable network coding
dc.typeConference paper
local.bibliographicCitation.lastpage6
local.bibliographicCitation.startpage1
local.contributor.affiliationTraskov, Danail, Technical University of Munich
local.contributor.affiliationMedard, Muriel, Massachusetts Institute of Technology
local.contributor.affiliationSadeghi, Parastoo, College of Engineering and Computer Science, ANU
local.contributor.affiliationKoetter, Ralf, Technical University of Munich
local.contributor.authoruidSadeghi, Parastoo, u4267276
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080401 - Coding and Information Theory
local.identifier.absfor100503 - Computer Communications Networks
local.identifier.ariespublicationu4708487xPUB27
local.identifier.doi10.1109/GLOCOM.2009.5425315
local.identifier.scopusID2-s2.0-77951605048
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Traskov_Joint_scheduling_and_2009.pdf
Size:
425.71 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS