Conference item icon

Conference item

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.
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1109/GLOCOMW.2016.7848824

Authors


More by this author
Department:
Oxford, MPLS, Engineering Science
Sadeghi, P More by this author
More by this author
Department:
Oxford, MPLS, Engineering Science
More from this funder
Grant:
EP/N002350/1 (Spatially Embedded Networks)
Publisher:
Institute of Electrical and Electronics Engineers Publisher's website
Publication date:
2016
Acceptance date:
2016-08-16
DOI:
Pubs id:
pubs:646457
URN:
uri:90e46a25-b9a2-4375-b7cf-7dc83e5ea566
UUID:
uuid:90e46a25-b9a2-4375-b7cf-7dc83e5ea566
Local pid:
pubs:646457
ISBN:
978-1-5090-2482-7

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP