Completion time reduction in instantly decodable network coding through decoding delay control

Ahmed S. Douik, Sameh Sorour, Mohamed-Slim Alouini, Tareq Y. Al-Naffouri

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

27 Scopus citations


For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effect of controlling the decoding delay to reduce the completion time below its currently best known solution. We first derive the decoding-delay-dependent expressions of the users' and their overall completion times. Although using such expressions to find the optimal overall completion time is NP-hard, we use a heuristic that minimizes the probability of increasing the maximum of these decoding-delay-dependent completion time expressions after each transmission through a layered control of their decoding delays. Simulation results show that this new algorithm achieves both a lower mean completion time and mean decoding delay compared to the best known heuristic for completion time reduction. The gap in performance becomes significant for harsh erasure scenarios.
Original languageEnglish (US)
Title of host publication2014 IEEE Global Communications Conference
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages6
ISBN (Print)9781479935116
StatePublished - Dec 2014

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01


Dive into the research topics of 'Completion time reduction in instantly decodable network coding through decoding delay control'. Together they form a unique fingerprint.

Cite this