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 proceedingConference contributionpeer-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 languageEnglish
    Title of host publication2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    ISBN (Electronic)9781509024827
    DOIs
    Publication statusPublished - 2016
    Event2016 IEEE Globecom Workshops, GC Wkshps 2016 - Washington, United States
    Duration: 4 Dec 20168 Dec 2016

    Publication series

    Name2016 IEEE Globecom Workshops, GC Wkshps 2016 - Proceedings

    Conference

    Conference2016 IEEE Globecom Workshops, GC Wkshps 2016
    Country/TerritoryUnited States
    CityWashington
    Period4/12/168/12/16

    Fingerprint

    Dive into the research topics of 'A random graph theoretic framework for analyzing instantly decodable network codes'. Together they form a unique fingerprint.

    Cite this