A random graph theoretic framework for analyzing instantly decodable network codes
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 an...
| Prif Awduron: | , , |
|---|---|
| Fformat: | Conference item |
| Cyhoeddwyd: |
Institute of Electrical and Electronics Engineers
2016
|
| Crynodeb: | 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. |
|---|