A lossy graph model for delay reduction in generalized instantly decodable network coding

Handle URI:
http://hdl.handle.net/10754/563580
Title:
A lossy graph model for delay reduction in generalized instantly decodable network coding
Authors:
Douik, Ahmed S. ( 0000-0001-7791-9443 ) ; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Electrical Engineering Program; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Wireless Communications Letters
Issue Date:
Jun-2014
DOI:
10.1109/WCL.2014.022814.140067
ARXIV:
arXiv:1311.0459
Type:
Article
ISSN:
21622337
Additional Links:
http://arxiv.org/abs/arXiv:1311.0459v1
Appears in Collections:
Articles; Electrical Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorDouik, Ahmed S.en
dc.contributor.authorSorour, Samehen
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2015-08-03T11:54:56Zen
dc.date.available2015-08-03T11:54:56Zen
dc.date.issued2014-06en
dc.identifier.issn21622337en
dc.identifier.doi10.1109/WCL.2014.022814.140067en
dc.identifier.urihttp://hdl.handle.net/10754/563580en
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.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://arxiv.org/abs/arXiv:1311.0459v1en
dc.subjectGIDNC graphen
dc.subjectlossy feedbacken
dc.subjectmaximum weight clique problemen
dc.subjectMinimum decoding delayen
dc.titleA lossy graph model for delay reduction in generalized instantly decodable network codingen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journalIEEE Wireless Communications Lettersen
dc.contributor.institutionElectrical Engineering Department, King Fahd University of Petroleum and Minerals (KFUPM), Dhahran, Eastern-Province, Saudi Arabiaen
dc.identifier.arxividarXiv:1311.0459en
kaust.authorDouik, Ahmed S.en
kaust.authorAl-Naffouri, Tareq Y.en
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.