Joint scheduling and instantaneously decodable network coding

Author(s)
Traskov, Danail; Medard, Muriel; Sadeghi, Parastoo; Koetter, Ralf
Thumbnail
DownloadTraskov-2009-Joint scheduling and instantaneously decodable network coding.pdf (424.9Kb)
PUBLISHER_POLICY
Terms of use
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.
Metadata
Show full item record
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.
Date issued
2009-11
URI
http://hdl.handle.net/1721.1/61717
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of Electronics
Journal
IEEE Global Telecommunications Conference
Publisher
Institute of Electrical and Electronics Engineers
Citation
Traskov, D. et al. “Joint Scheduling and Instantaneously Decodable Network Coding.” Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE. 2009. 1-6. © 2009, IEEE
Version: Final published version
Other identifiers
INSPEC Accession Number: 11170256
ISBN
978-1-4244-4148-8
ISSN
1930-529X
Collections