CaltechAUTHORS
  A Caltech Library Service

Delivery time reduction for order-constrained applications using binary network codes

Douik, Ahmed and Karim, Mohammad S. and Sadeghi, Parastoo and Sorour, Sameh (2016) Delivery time reduction for order-constrained applications using binary network codes. In: 2016 IEEE Wireless Communications and Networking Conference (WCNC). IEEE , Piscataway, NJ, pp. 1-6. ISBN 978-1-4673-9815-2. https://resolver.caltech.edu/CaltechAUTHORS:20160921-122749114

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:20160921-122749114

Abstract

Consider a radio access network wherein a basestation is required to deliver a set of order-constrained messages to a set of users over independent erasure channels. This paper studies the delivery time reduction problem using instantly decodable network coding (IDNC). Motivated by time-critical and order-constrained applications, the delivery time is defined, at each transmission, as the number of undelivered messages. The delivery time minimization problem being computationally intractable, most of the existing literature on IDNC propose suboptimal online solutions. This paper suggests a novel method for solving the problem by introducing the delivery delay as a measure of distance to optimality. An expression characterizing the delivery time using the delivery delay is derived, allowing the approximation of the delivery time minimization problem by an optimization problem involving the delivery delay. The problem is, then, formulated as a maximum weight clique selection problem over the IDNC graph wherein the weight of each vertex reflects its corresponding user and message's delay. Simulation results suggest that the proposed solution achieves lower delivery and completion times as compared to the best-known heuristics for delivery time reduction.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/WCNC.2016.7565067DOIArticle
http://ieeexplore.ieee.org/document/7565067/PublisherArticle
ORCID:
AuthorORCID
Douik, Ahmed0000-0001-7791-9443
Karim, Mohammad S.0000-0003-3023-4396
Sorour, Sameh0000-0002-3936-7833
Additional Information:© 2016 IEEE.
Subject Keywords:Instantly decodable network coding, order-constrained, delivery time, delivery delay, maximum weight clique
Record Number:CaltechAUTHORS:20160921-122749114
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20160921-122749114
Official Citation:A. Douik, M. S. Karim, P. Sadeghi and S. Sorour, "Delivery time reduction for order-constrained applications using binary network codes," 2016 IEEE Wireless Communications and Networking Conference, Doha, Qatar, 2016, pp. 1-6. doi: 10.1109/WCNC.2016.7565067 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7565067&isnumber=7564633
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:70503
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:29 Sep 2016 20:32
Last Modified:03 Oct 2019 10:31

Repository Staff Only: item control page