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

Handle URI:
http://hdl.handle.net/10754/565007
Title:
Completion time reduction in instantly decodable network coding through decoding delay control
Authors:
Douik, Ahmed S. ( 0000-0001-7791-9443 ) ; Sorour, Sameh; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 ) ; Al-Naffouri, Tareq Y.
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 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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Electrical Engineering Program; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2014 IEEE Global Communications Conference
Conference/Event name:
2014 IEEE Global Communications Conference, GLOBECOM 2014
Issue Date:
Dec-2014
DOI:
10.1109/GLOCOM.2014.7037599
ARXIV:
arXiv:1404.3677
Type:
Conference Paper
ISBN:
9781479935116
Additional Links:
http://arxiv.org/abs/arXiv:1404.3677v1
Appears in Collections:
Conference Papers; Electrical Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorDouik, Ahmed S.en
dc.contributor.authorSorour, Samehen
dc.contributor.authorAlouini, Mohamed-Slimen
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.date.accessioned2015-08-04T07:28:00Zen
dc.date.available2015-08-04T07:28:00Zen
dc.date.issued2014-12en
dc.identifier.isbn9781479935116en
dc.identifier.doi10.1109/GLOCOM.2014.7037599en
dc.identifier.urihttp://hdl.handle.net/10754/565007en
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 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.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://arxiv.org/abs/arXiv:1404.3677v1en
dc.subjectDecoding delayen
dc.subjectInstantly decodable network codingen
dc.subjectMinimum completion timeen
dc.titleCompletion time reduction in instantly decodable network coding through decoding delay controlen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journal2014 IEEE Global Communications Conferenceen
dc.conference.date8 December 2014 through 12 December 2014en
dc.conference.name2014 IEEE Global Communications Conference, GLOBECOM 2014en
dc.contributor.institutionKing Fand University of Petroleum and Minerals (KFUPM), Saudi Arabiaen
dc.identifier.arxividarXiv:1404.3677en
kaust.authorDouik, Ahmed S.en
kaust.authorAlouini, Mohamed-Slimen
kaust.authorAl-Naffouri, Tareq Y.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.