A lossy graph model for delay reduction in generalized instantly decodable network coding
Type
ArticleKAUST Department
Communication Theory LabComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
Date
2014-06Preprint Posting Date
2013-11-03Permanent link to this record
http://hdl.handle.net/10754/563580
Metadata
Show full item recordAbstract
The problem of minimizing the decoding delay in Generalized instantly decodable network coding (G-IDNC) for both perfect and lossy feedback scenarios is formulated as a maximum weight clique problem over the G-IDNC graph in. In this letter, we introduce a new lossy G-IDNC graph (LG-IDNC) model to further minimize the decoding delay in lossy feedback scenarios. Whereas the G-IDNC graph represents only doubtless combinable packets, the LG-IDNC graph represents also uncertain packet combinations, arising from lossy feedback events, when the expected decoding delay of XORing them among themselves or with other certain packets is lower than that expected when sending these packets separately. We compare the decoding delay performance of LG-IDNC and G-IDNC graphs through extensive simulations. Numerical results show that our new LG-IDNC graph formulation outperforms the G-IDNC graph formulation in all lossy feedback situations and achieves significant improvement in the decoding delay especially when the feedback erasure probability is higher than the packet erasure probability. © 2012 IEEE.Citation
Douik, A., Sorour, S., Al-Naffouri, T. Y., & Alouini, M.-S. (2014). A Lossy Graph Model for Delay Reduction in Generalized Instantly Decodable Network Coding. IEEE Wireless Communications Letters, 3(3), 281–284. doi:10.1109/wcl.2014.022814.140067arXiv
1311.0459Additional Links
http://arxiv.org/abs/arXiv:1311.0459v1ae974a485f413a2113503eed53cd6c53
10.1109/WCL.2014.022814.140067