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

Sameh Sorour, Neda Aboutorab, Parastoo Sadeghi, Mohammad Shahriar Karim, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

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.
Original languageEnglish (US)
Title of host publication2013 IEEE 77th Vehicular Technology Conference (VTC Spring)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
ISBN (Print)9781467363372
DOIs
StatePublished - Jun 2013

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01

Fingerprint Dive into the research topics of 'Delay reduction in persistent erasure channels for generalized instantly decodable network coding'. Together they form a unique fingerprint.

Cite this