Name
Title | ||
|---|---|---|
Delay reduction in lossy intermittent feedback for generalized instantly decodable network coding |
Abstract | ||
|---|---|---|
In this paper, we study the effect of lossy intermittent feedback loss events on the multicast decoding delay performance of generalized instantly decodable network coding. These feedback loss events create uncertainty at the sender about the reception statues of different receivers and thus uncertainty to accurately determine subsequent instantly decodable coded packets. To solve this problem, we first identify the different possibilities of uncertain packets at the sender and their probabilities. We then derive the expression of the mean decoding delay. We formulate the Generalized Instantly Decodable Network Coding (G-IDNC) minimum decoding delay problem as a maximum weight clique problem. Since finding the optimal solution is NP-hard, we design a variant of the algorithm employed in [1]. Our algorithm is compared to the two blind graph update proposed in [2] through extensive simulations. Results show that our algorithm outperforms the blind approaches in all the situations and achieves a tolerable degradation, against the perfect feedback, for large feedback loss period. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/WiMOB.2013.6673389 | Wireless and Mobile Computing, Networking and Communications |
Keywords | Field | DocType |
computational complexity,decoding,network coding,G-IDNC minimum decoding delay problem,NP-hard optimal solution,blind graph update,decodable coded packets,delay reduction,generalized instantly-decodable network coding,lossy intermittent feedback loss events,maximum weight clique problem,mean decoding delay,multicast decoding delay performance,receiver reception statue,uncertain packets,Lossy Intermittent Feedback,Maximum Weight Clique Problem,Minimum Decoding Delay,Multicast Channels | Linear network coding,Lossy compression,Computer science,Network packet,Communication source,Decoding methods,Multicast,Clique problem,Computational complexity theory,Distributed computing | Conference |
ISSN | Citations | PageRank |
2160-4886 | 16 | 0.65 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Douik | 1 | 26 | 1.19 |
| S. Sorour | 2 | 43 | 2.25 |
| Alouini Mohamed-Slim | 3 | 12261 | 1194.14 |
| Al-Naffouri, T.Y. | 4 | 161 | 12.05 |