Show simple item record

dc.contributor.authorDouik, Ahmed S.
dc.contributor.authorSorour, Sameh
dc.contributor.authorAl-Naffouri, Tareq Y.
dc.contributor.authorAlouini, Mohamed-Slim
dc.date.accessioned2015-08-03T11:54:56Z
dc.date.available2015-08-03T11:54:56Z
dc.date.issued2014-06
dc.identifier.citationDouik, 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.140067
dc.identifier.issn21622337
dc.identifier.doi10.1109/WCL.2014.022814.140067
dc.identifier.urihttp://hdl.handle.net/10754/563580
dc.description.abstractThe 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.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttp://arxiv.org/abs/arXiv:1311.0459v1
dc.subjectGIDNC graph
dc.subjectlossy feedback
dc.subjectmaximum weight clique problem
dc.subjectMinimum decoding delay
dc.titleA lossy graph model for delay reduction in generalized instantly decodable network coding
dc.typeArticle
dc.contributor.departmentCommunication Theory Lab
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.identifier.journalIEEE Wireless Communications Letters
dc.contributor.institutionElectrical Engineering Department, King Fahd University of Petroleum and Minerals (KFUPM), Dhahran, Eastern-Province, Saudi Arabia
dc.identifier.arxivid1311.0459
kaust.personDouik, Ahmed S.
kaust.personAl-Naffouri, Tareq Y.
kaust.personAlouini, Mohamed-Slim
dc.versionv1
dc.date.posted2013-11-03


This item appears in the following Collection(s)

Show simple item record