Adaptive network coding for broadcast channels

Parastoo Sadeghi; Danail Traskov; Ralf Koetter

doi:10.1109/NETCOD.2009.5191398

Adaptive network coding for broadcast channels

Parastoo Sadeghi^*, Danail Traskov, Ralf Koetter

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

90 Citations (Scopus)

Abstract

We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.

Original language	English
Title of host publication	2009 Workshop on Network Coding, Theory and Applications, NetCod '09
Pages	80-85
Number of pages	6
DOIs	https://doi.org/10.1109/NETCOD.2009.5191398
Publication status	Published - 2009
Event	2009 Workshop on Network Coding, Theory and Applications, NetCod '09 - Lausanne, Switzerland Duration: 15 Jun 2009 → 16 Jun 2009

Publication series

Name	2009 Workshop on Network Coding, Theory and Applications, NetCod '09

Conference

Conference	2009 Workshop on Network Coding, Theory and Applications, NetCod '09
Country/Territory	Switzerland
City	Lausanne
Period	15/06/09 → 16/06/09

Access to Document

10.1109/NETCOD.2009.5191398

Cite this

@inproceedings{ce94a5324aeb45648ccb0c051fcf66e1,

title = "Adaptive network coding for broadcast channels",

abstract = "We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.",

keywords = "Broadcast channels, Gilbert-elliott channel, Integer programming, Network coding, Opportunistic coding",

author = "Parastoo Sadeghi and Danail Traskov and Ralf Koetter",

year = "2009",

doi = "10.1109/NETCOD.2009.5191398",

language = "English",

isbn = "9781424447244",

series = "2009 Workshop on Network Coding, Theory and Applications, NetCod '09",

pages = "80--85",

booktitle = "2009 Workshop on Network Coding, Theory and Applications, NetCod '09",

note = "2009 Workshop on Network Coding, Theory and Applications, NetCod '09 ; Conference date: 15-06-2009 Through 16-06-2009",

}

Sadeghi, P, Traskov, D & Koetter, R 2009, Adaptive network coding for broadcast channels. in 2009 Workshop on Network Coding, Theory and Applications, NetCod '09., 5191398, 2009 Workshop on Network Coding, Theory and Applications, NetCod '09, pp. 80-85, 2009 Workshop on Network Coding, Theory and Applications, NetCod '09, Lausanne, Switzerland, 15/06/09. https://doi.org/10.1109/NETCOD.2009.5191398

Adaptive network coding for broadcast channels. / Sadeghi, Parastoo; Traskov, Danail; Koetter, Ralf.
2009 Workshop on Network Coding, Theory and Applications, NetCod '09. 2009. p. 80-85 5191398 (2009 Workshop on Network Coding, Theory and Applications, NetCod '09).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Adaptive network coding for broadcast channels

AU - Sadeghi, Parastoo

AU - Traskov, Danail

AU - Koetter, Ralf

PY - 2009

Y1 - 2009

N2 - We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.

AB - We consider the throughput-delay tradeoff in network coded transmission over erasure broadcast channels. Interested in minimizing decoding delay, we formulate the problem of instantly decodable network coding as an integer linear program and propose algorithms to solve it heuristically. In particular, we investigate channels with memory and propose algorithms that can exploit channel erasure dependence to increase throughput and decrease delay.

KW - Broadcast channels

KW - Gilbert-elliott channel

KW - Integer programming

KW - Network coding

KW - Opportunistic coding

UR - http://www.scopus.com/inward/record.url?scp=77950835674&partnerID=8YFLogxK

U2 - 10.1109/NETCOD.2009.5191398

DO - 10.1109/NETCOD.2009.5191398

M3 - Conference contribution

SN - 9781424447244

T3 - 2009 Workshop on Network Coding, Theory and Applications, NetCod '09

SP - 80

EP - 85

BT - 2009 Workshop on Network Coding, Theory and Applications, NetCod '09

T2 - 2009 Workshop on Network Coding, Theory and Applications, NetCod '09

Y2 - 15 June 2009 through 16 June 2009

ER -

Adaptive network coding for broadcast channels

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this