Delay reduction in persistent erasure channels for generalized instantly decodable network coding

Handle URI:
http://hdl.handle.net/10754/564758
Title:
Delay reduction in persistent erasure channels for generalized instantly decodable network coding
Authors:
Sorour, Sameh; Aboutorab, Neda; Sadeghi, Parastoo; Karim, Mohammad Shahriar; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Abstract:
In this paper, we consider the problem of minimizing the decoding delay of generalized instantly decodable network coding (G-IDNC) in persistent erasure channels (PECs). By persistent erasure channels, we mean erasure channels with memory, which are modeled as a Gilbert-Elliott two-state Markov model with good and bad channel states. In this scenario, the channel erasure dependence, represented by the transition probabilities of this channel model, is an important factor that could be exploited to reduce the decoding delay. We first formulate the G-IDNC minimum decoding delay problem in PECs as a maximum weight clique problem over the G-IDNC graph. Since finding the optimal solution of this formulation is NP-hard, we propose two heuristic algorithms to solve it and compare them using extensive simulations. Simulation results show that each of these heuristics outperforms the other in certain ranges of channel memory levels. They also show that the proposed heuristics significantly outperform both the optimal strict IDNC in the literature and the channel-unaware G-IDNC algorithms. © 2013 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:
2013 IEEE 77th Vehicular Technology Conference (VTC Spring)
Conference/Event name:
2013 IEEE 77th Vehicular Technology Conference, VTC Spring 2013
Issue Date:
Jun-2013
DOI:
10.1109/VTCSpring.2013.6692503
Type:
Conference Paper
ISSN:
15502252
ISBN:
9781467363372
Appears in Collections:
Conference Papers; 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.authorAboutorab, Nedaen
dc.contributor.authorSadeghi, Parastooen
dc.contributor.authorKarim, Mohammad Shahriaren
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2015-08-04T07:14:59Zen
dc.date.available2015-08-04T07:14:59Zen
dc.date.issued2013-06en
dc.identifier.isbn9781467363372en
dc.identifier.issn15502252en
dc.identifier.doi10.1109/VTCSpring.2013.6692503en
dc.identifier.urihttp://hdl.handle.net/10754/564758en
dc.description.abstractIn this paper, we consider the problem of minimizing the decoding delay of generalized instantly decodable network coding (G-IDNC) in persistent erasure channels (PECs). By persistent erasure channels, we mean erasure channels with memory, which are modeled as a Gilbert-Elliott two-state Markov model with good and bad channel states. In this scenario, the channel erasure dependence, represented by the transition probabilities of this channel model, is an important factor that could be exploited to reduce the decoding delay. We first formulate the G-IDNC minimum decoding delay problem in PECs as a maximum weight clique problem over the G-IDNC graph. Since finding the optimal solution of this formulation is NP-hard, we propose two heuristic algorithms to solve it and compare them using extensive simulations. Simulation results show that each of these heuristics outperforms the other in certain ranges of channel memory levels. They also show that the proposed heuristics significantly outperform both the optimal strict IDNC in the literature and the channel-unaware G-IDNC algorithms. © 2013 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectBroadcast channelsen
dc.subjectDecoding delayen
dc.subjectGilbert-elliott channelen
dc.subjectInstantly decodable network codingen
dc.titleDelay reduction in persistent erasure channels for generalized instantly decodable network codingen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journal2013 IEEE 77th Vehicular Technology Conference (VTC Spring)en
dc.conference.date2 June 2013 through 5 June 2013en
dc.conference.name2013 IEEE 77th Vehicular Technology Conference, VTC Spring 2013en
dc.conference.locationDresdenen
dc.contributor.institutionResearch School of Information Sciences and Engineering, Australian National University, Australiaen
dc.contributor.institutionKing Fahd University of Petroleum and Minerals (KFUPM), Saudi Arabiaen
kaust.authorSorour, Samehen
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.