On minimizing the maximum broadcast decoding delay for instantly decodable network coding

Handle URI:
http://hdl.handle.net/10754/564978
Title:
On minimizing the maximum broadcast decoding delay for instantly decodable network coding
Authors:
Douik, Ahmed S. ( 0000-0001-7791-9443 ) ; Sorour, Sameh; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 ) ; Ai-Naffouri, Tareq Y.
Abstract:
In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a definition of delay for IDNC allows a more equitable distribution of the delays between the different receivers and thus a better Quality of Service (QoS). In order to solve this problem, we first derive the expressions for the probability distributions of maximum decoding delay increments. Given these expressions, we formulate the problem as a maximum weight clique problem in the IDNC graph. Although this problem is known to be NP-hard, we design a greedy algorithm to perform effective packet selection. Through extensive simulations, we compare the sum decoding delay and the max decoding delay experienced when applying the policies to minimize the sum decoding delay and our policy to reduce the max decoding delay. Simulations results show that our policy gives a good agreement among all the delay aspects in all situations and outperforms the sum decoding delay policy to effectively minimize the sum decoding delay when the channel conditions become harsher. They also show that our definition of delay significantly improve the number of served receivers when they are subject to strict delay constraints.
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 80th Vehicular Technology Conference (VTC2014-Fall)
Conference/Event name:
80th IEEE Vehicular Technology Conference, VTC 2014-Fall
Issue Date:
Sep-2014
DOI:
10.1109/VTCFall.2014.6966079
ARXIV:
arXiv:1404.0265
Type:
Conference Paper
ISSN:
15502252
ISBN:
9781479944491; 9781479944491
Additional Links:
http://arxiv.org/abs/arXiv:1404.0265v1
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.authorAi-Naffouri, Tareq Y.en
dc.date.accessioned2015-08-04T07:26:54Zen
dc.date.available2015-08-04T07:26:54Zen
dc.date.issued2014-09en
dc.identifier.isbn9781479944491; 9781479944491en
dc.identifier.issn15502252en
dc.identifier.doi10.1109/VTCFall.2014.6966079en
dc.identifier.urihttp://hdl.handle.net/10754/564978en
dc.description.abstractIn this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a definition of delay for IDNC allows a more equitable distribution of the delays between the different receivers and thus a better Quality of Service (QoS). In order to solve this problem, we first derive the expressions for the probability distributions of maximum decoding delay increments. Given these expressions, we formulate the problem as a maximum weight clique problem in the IDNC graph. Although this problem is known to be NP-hard, we design a greedy algorithm to perform effective packet selection. Through extensive simulations, we compare the sum decoding delay and the max decoding delay experienced when applying the policies to minimize the sum decoding delay and our policy to reduce the max decoding delay. Simulations results show that our policy gives a good agreement among all the delay aspects in all situations and outperforms the sum decoding delay policy to effectively minimize the sum decoding delay when the channel conditions become harsher. They also show that our definition of delay significantly improve the number of served receivers when they are subject to strict delay constraints.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://arxiv.org/abs/arXiv:1404.0265v1en
dc.subjectGeneralized instantly decodable network codingen
dc.subjectmax decoding delayen
dc.subjectmaximum weight clique search.en
dc.subjectminimum delayen
dc.subjectsum decoding delayen
dc.titleOn minimizing the maximum broadcast decoding delay for instantly decodable network codingen
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 80th Vehicular Technology Conference (VTC2014-Fall)en
dc.conference.date14 September 2014 through 17 September 2014en
dc.conference.name80th IEEE Vehicular Technology Conference, VTC 2014-Fallen
dc.contributor.institutionKing Fahd University of Petroleum and Minerals (KFUPM), Saudi Arabiaen
dc.identifier.arxividarXiv:1404.0265en
kaust.authorDouik, Ahmed S.en
kaust.authorAlouini, Mohamed-Slimen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.