Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding

Handle URI:
http://hdl.handle.net/10754/617076
Title:
Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding
Authors:
Douik, Ahmed ( 0000-0001-7791-9443 ) ; Sorour, Sameh; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
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.
KAUST Department:
Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
Citation:
Decoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding 2016:1 IEEE Transactions on Vehicular Technology
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Transactions on Vehicular Technology
Issue Date:
27-Jun-2016
DOI:
10.1109/TVT.2016.2585381
Type:
Article
ISSN:
0018-9545; 1939-9359
Additional Links:
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7500144
Appears in Collections:
Articles

Full metadata record

DC FieldValue Language
dc.contributor.authorDouik, Ahmeden
dc.contributor.authorSorour, Samehen
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.contributor.authorAlouini, Mohamed-Slimen
dc.date.accessioned2016-07-17T09:43:59Z-
dc.date.available2016-07-17T09:43:59Z-
dc.date.issued2016-06-27-
dc.identifier.citationDecoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Coding 2016:1 IEEE Transactions on Vehicular Technologyen
dc.identifier.issn0018-9545-
dc.identifier.issn1939-9359-
dc.identifier.doi10.1109/TVT.2016.2585381-
dc.identifier.urihttp://hdl.handle.net/10754/617076-
dc.description.abstractFor 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.en
dc.language.isoenen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7500144en
dc.rights(c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.en
dc.subjectInstantly decodable network codingen
dc.subjectdecoding delayen
dc.subjectminimum completion timeen
dc.subjectperfect/imperfect feedbacken
dc.titleDecoding Delay Controlled Completion Time Reduction in Instantly Decodable Network Codingen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Science and Engineering (CEMSE) Divisionen
dc.identifier.journalIEEE Transactions on Vehicular Technologyen
dc.eprint.versionPost-printen
dc.contributor.institutionDepartment of Electrical Engineering, California Institute of Technology, Pasadena, CA 91125 USAen
dc.contributor.institutionDepartment of Electrical and Computer Engineering, University of Idaho, Moscow, ID 83844, USAen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
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.