A random graph theoretic framework for analyzing instantly decodable network codes

Shahriar Etemadi Tajbakhsh; Parastoo Sadeghi; Justin Coon

doi:10.1109/GLOCOMW.2016.7848824

A random graph theoretic framework for analyzing instantly decodable network codes

Shahriar Etemadi Tajbakhsh, Parastoo Sadeghi, Justin Coon

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

1 Citation (Scopus)

Abstract

In this paper, we consider Instantly Decodable Network Codes (IDNC) in centralized and cooperative wireless networks. Analyzing the performance of these codes in terms of decoding delay under erasure channel assumption is highly complicated in general. We use some results from random graph theory and apply various relaxations to provide a closed form approximation of the average decoding delay. Our experiments show that the gap between analytical approximation and numerical results is small.

Original language	English
Title of host publication	2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781509024827
DOIs	https://doi.org/10.1109/GLOCOMW.2016.7848824
Publication status	Published - 2016
Event	2016 IEEE Globecom Workshops, GC Wkshps 2016 - Washington, United States Duration: 4 Dec 2016 → 8 Dec 2016

Publication series

Name	2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings

Conference

Conference	2016 IEEE Globecom Workshops, GC Wkshps 2016
Country/Territory	United States
City	Washington
Period	4/12/16 → 8/12/16

Access to Document

10.1109/GLOCOMW.2016.7848824

Cite this

Tajbakhsh, S. E., Sadeghi, P., & Coon, J. (2016). A random graph theoretic framework for analyzing instantly decodable network codes. In 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings Article 7848824 (2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOMW.2016.7848824

@inproceedings{97a9715bff3a420fbb797d7af8f825f3,

title = "A random graph theoretic framework for analyzing instantly decodable network codes",

abstract = "In this paper, we consider Instantly Decodable Network Codes (IDNC) in centralized and cooperative wireless networks. Analyzing the performance of these codes in terms of decoding delay under erasure channel assumption is highly complicated in general. We use some results from random graph theory and apply various relaxations to provide a closed form approximation of the average decoding delay. Our experiments show that the gap between analytical approximation and numerical results is small.",

author = "Tajbakhsh, \{Shahriar Etemadi\} and Parastoo Sadeghi and Justin Coon",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE Globecom Workshops, GC Wkshps 2016 ; Conference date: 04-12-2016 Through 08-12-2016",

year = "2016",

doi = "10.1109/GLOCOMW.2016.7848824",

language = "English",

series = "2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings",

address = "United States",

}

Tajbakhsh, SE, Sadeghi, P & Coon, J 2016, A random graph theoretic framework for analyzing instantly decodable network codes. in 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings., 7848824, 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings, Institute of Electrical and Electronics Engineers Inc., 2016 IEEE Globecom Workshops, GC Wkshps 2016, Washington, United States, 4/12/16. https://doi.org/10.1109/GLOCOMW.2016.7848824

A random graph theoretic framework for analyzing instantly decodable network codes. / Tajbakhsh, Shahriar Etemadi; Sadeghi, Parastoo; Coon, Justin.
2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2016. 7848824 (2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings).

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

TY - GEN

T1 - A random graph theoretic framework for analyzing instantly decodable network codes

AU - Tajbakhsh, Shahriar Etemadi

AU - Sadeghi, Parastoo

AU - Coon, Justin

PY - 2016

Y1 - 2016

N2 - In this paper, we consider Instantly Decodable Network Codes (IDNC) in centralized and cooperative wireless networks. Analyzing the performance of these codes in terms of decoding delay under erasure channel assumption is highly complicated in general. We use some results from random graph theory and apply various relaxations to provide a closed form approximation of the average decoding delay. Our experiments show that the gap between analytical approximation and numerical results is small.

AB - In this paper, we consider Instantly Decodable Network Codes (IDNC) in centralized and cooperative wireless networks. Analyzing the performance of these codes in terms of decoding delay under erasure channel assumption is highly complicated in general. We use some results from random graph theory and apply various relaxations to provide a closed form approximation of the average decoding delay. Our experiments show that the gap between analytical approximation and numerical results is small.

UR - https://www.scopus.com/pages/publications/85015833114

U2 - 10.1109/GLOCOMW.2016.7848824

DO - 10.1109/GLOCOMW.2016.7848824

M3 - Conference Paper

T3 - 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings

BT - 2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE Globecom Workshops, GC Wkshps 2016

Y2 - 4 December 2016 through 8 December 2016

ER -

A random graph theoretic framework for analyzing instantly decodable network codes

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this