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

Actions


Access Document


Files:
Publisher copy:
10.1109/GLOCOMW.2016.7848824

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
More from this funder
Grant:
EP/N002350/1 (Spatially Embedded Networks
Publisher:
Institute of Electrical and Electronics Engineers Publisher's website
Journal:
IEEE Globecom 2016 Journal website
Host title:
2016 IEEE Globecom Workshops (GC Wkshps)
Publication date:
2016-01-01
Acceptance date:
2016-08-16
DOI:
Source identifiers:
646457
ISBN:
9781509024827
Pubs id:
pubs:646457
UUID:
uuid:90e46a25-b9a2-4375-b7cf-7dc83e5ea566
Local pid:
pubs:646457
Deposit date:
2016-09-28

Terms of use


Views and Downloads






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

TO TOP