Generalized instantly decodable network coding for relay-assisted networks

Adel M. Elmahdy, Sameh Sorour, Karim G. Seddik

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

4 Scopus citations

Abstract

In this paper, we investigate the problem of minimizing the frame completion delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless multicast networks. We first propose a packet recovery algorithm in the single relay topology which employs generalized IDNC instead of strict IDNC previously proposed in the literature for the same relay-assisted topology. This use of generalized IDNC is supported by showing that it is a super-set of the strict IDNC scheme, and thus can generate coding combinations that are at least as efficient as strict IDNC in reducing the average completion delay. We then extend our study to the multiple relay topology and propose a joint generalized IDNC and relay selection algorithm. This proposed algorithm benefits from the reception diversity of the multiple relays to further reduce the average completion delay in the network. Simulation results show that our proposed solutions achieve much better performance compared to previous solutions in the literature. © 2013 IEEE.
Original languageEnglish (US)
Title of host publication2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1759-1763
Number of pages5
ISBN (Print)9781467362351
DOIs
StatePublished - Sep 2013

Fingerprint Dive into the research topics of 'Generalized instantly decodable network coding for relay-assisted networks'. Together they form a unique fingerprint.

Cite this