CaltechAUTHORS
  A Caltech Library Service

Decoding-Delay-Controlled Completion Time Reduction in Instantly Decodable Network Coding

Douik, Ahmed and Sorour, Sameh and Al-Naffouri, Tareq Y. and Alouini, Mohamed-Slim (2017) Decoding-Delay-Controlled Completion Time Reduction in Instantly Decodable Network Coding. IEEE Transactions on Vehicular Technology, 66 (3). pp. 2756-2770. ISSN 0018-9545. https://resolver.caltech.edu/CaltechAUTHORS:20160706-075625163

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20160706-075625163

Abstract

For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to act completely 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. This paper investigates the effect of controlling the decoding delay to reduce the completion time below its currently best-known solution in both perfect and imperfect feedback with persistent erasure channels. To solve the problem, the decodingdelay- dependent expressions of the users’ and overall completion times are derived in the complete feedback scenario. Although using such expressions to find the optimal overall completion time is NP-hard, the paper proposes two novel heuristics 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. Afterward, the paper extends the study to the imperfect feedback scenario in which uncertainties at the sender affects its ability to anticipate accurately the decoding delay increase at each user. The paper formulates the problem in such environment and derives the expression of the minimum increase in the completion time. Simulation results show the performance of the proposed solutions and suggest that both heuristics achieves a lower mean completion time as compared to the best-known heuristics for the completion time reduction in perfect and imperfect feedback. The gap in performance becomes more significant as the erasure of the channel increases.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/TVT.2016.2585381DOIArticle
http://ieeexplore.ieee.org/document/7500144/PublisherArticle
ORCID:
AuthorORCID
Douik, Ahmed0000-0001-7791-9443
Sorour, Sameh0000-0002-3936-7833
Additional Information:© 2016 IEEE. Manuscript received January 25, 2016; revised April 23, 2016; accepted June 14, 2016. Date of publication June 27, 2016; date of current version March 10, 2017. A part of this paper appears in the Proceedings of IEEE Global Telecommunications Conference (GLOBECOM 2014), Austin, TX, USA, December 2014. The review of this paper was coordinated by Dr. X. Huang.
Subject Keywords:Instantly decodable network coding; minimum completion time, decoding delay, perfect/imperfect feedback
Issue or Number:3
Record Number:CaltechAUTHORS:20160706-075625163
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20160706-075625163
Official Citation:A. Douik, S. Sorour, T. Y. Al-Naffouri and M. S. Alouini, "Decoding-Delay-Controlled Completion Time Reduction in Instantly Decodable Network Coding," in IEEE Transactions on Vehicular Technology, vol. 66, no. 3, pp. 2756-2770, March 2017. doi: 10.1109/TVT.2016.2585381
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:68842
Collection:CaltechAUTHORS
Deposited By: Ruth Sustaita
Deposited On:06 Jul 2016 21:37
Last Modified:03 Oct 2019 10:16

Repository Staff Only: item control page