Partially blind instantly decodable network codes for lossy feedback environment

Handle URI:
http://hdl.handle.net/10754/563742
Title:
Partially blind instantly decodable network codes for lossy feedback environment
Authors:
Sorour, Sameh; Douik, Ahmed S. ( 0000-0001-7791-9443 ) ; Valaee, Shahrokh; Al-Naffouri, Tareq Y. ( 0000-0003-2843-5084 ) ; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
In this paper, we study the multicast completion and decoding delay minimization problems for instantly decodable network coding (IDNC) in the case of lossy feedback. When feedback loss events occur, the sender falls into uncertainties about packet reception at the different receivers, which forces it to perform partially blind selections of packet combinations in subsequent transmissions. To determine efficient selection policies that reduce the completion and decoding delays of IDNC in such an environment, we first extend the perfect feedback formulation in our previous works to the lossy feedback environment, by incorporating the uncertainties resulting from unheard feedback events in these formulations. For the completion delay problem, we use this formulation to identify the maximum likelihood state of the network in events of unheard feedback and employ it to design a partially blind graph update extension to the multicast IDNC algorithm in our earlier work. For the decoding delay problem, we derive an expression for the expected decoding delay increment for any arbitrary transmission. This expression is then used to find the optimal policy that reduces the decoding delay in such lossy feedback environment. Results show that our proposed solutions both outperform previously proposed approaches and achieve tolerable degradation even at relatively high feedback loss rates.
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 Transactions on Wireless Communications
Issue Date:
Sep-2014
DOI:
10.1109/TWC.2014.2321397
ARXIV:
arXiv:1307.3791
Type:
Article
ISSN:
15361276
Additional Links:
http://arxiv.org/abs/arXiv:1307.3791v1
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.authorSorour, Samehen
dc.contributor.authorDouik, Ahmed S.en
dc.contributor.authorValaee, Shahrokhen
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2015-08-03T12:08:35Zen
dc.date.available2015-08-03T12:08:35Zen
dc.date.issued2014-09en
dc.identifier.issn15361276en
dc.identifier.doi10.1109/TWC.2014.2321397en
dc.identifier.urihttp://hdl.handle.net/10754/563742en
dc.description.abstractIn this paper, we study the multicast completion and decoding delay minimization problems for instantly decodable network coding (IDNC) in the case of lossy feedback. When feedback loss events occur, the sender falls into uncertainties about packet reception at the different receivers, which forces it to perform partially blind selections of packet combinations in subsequent transmissions. To determine efficient selection policies that reduce the completion and decoding delays of IDNC in such an environment, we first extend the perfect feedback formulation in our previous works to the lossy feedback environment, by incorporating the uncertainties resulting from unheard feedback events in these formulations. For the completion delay problem, we use this formulation to identify the maximum likelihood state of the network in events of unheard feedback and employ it to design a partially blind graph update extension to the multicast IDNC algorithm in our earlier work. For the decoding delay problem, we derive an expression for the expected decoding delay increment for any arbitrary transmission. This expression is then used to find the optimal policy that reduces the decoding delay in such lossy feedback environment. Results show that our proposed solutions both outperform previously proposed approaches and achieve tolerable degradation even at relatively high feedback loss rates.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://arxiv.org/abs/arXiv:1307.3791v1en
dc.subjectInstantly decodable network codingen
dc.subjectlossy feedbacken
dc.subjectwireless multicasten
dc.titlePartially blind instantly decodable network codes for lossy feedback environmenten
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 Transactions on Wireless Communicationsen
dc.contributor.institutionElectrical Engineering Department, King Fahd University of Petroleum and MineralsDhahran, Saudi Arabiaen
dc.contributor.institutionEdward S. Rogers Sr. Department of Electrical and Computer Engineering, University of TorontoToronto, ON, Canadaen
dc.contributor.institutionElectrial Engineering Department, King Fahd University of Petroleum and MineralsDhahran, Saudi Arabiaen
dc.identifier.arxividarXiv:1307.3791en
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.