TY - GEN
T1 - A random graph theoretic framework for analyzing instantly decodable network codes
AU - Tajbakhsh, Shahriar Etemadi
AU - Sadeghi, Parastoo
AU - Coon, Justin
N1 - Publisher Copyright:
© 2016 IEEE.
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 - http://www.scopus.com/inward/record.url?scp=85015833114&partnerID=8YFLogxK
U2 - 10.1109/GLOCOMW.2016.7848824
DO - 10.1109/GLOCOMW.2016.7848824
M3 - Conference contribution
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 -