CaltechAUTHORS
  A Caltech Library Service

Rate Aware Instantly Decodable Network Codes

Douik, Ahmed and Sorour, Sameh and Al-Naffouri, Tareq Y. and Alouini, Mohamed-Slim (2017) Rate Aware Instantly Decodable Network Codes. IEEE Transactions on Wireless Communications, 16 (2). pp. 998-1011. ISSN 1536-1276. https://resolver.caltech.edu/CaltechAUTHORS:20170111-141802237

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:20170111-141802237

Abstract

This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications and abstract the model as equally slotted time for all users, this paper proposes a crosslayer scheme that incorporates the different channel rates of the various users in the decision process of both the transmitted message combinations and the rates with which they are transmitted. The consideration of asymmetric rates for receivers reflects more practical application scenarios and introduces a new trade-off between the choice of coding combinations for various receivers and the broadcasting rates. The completion time minimization problem in such scenario is first shown to be intractable. The problem is thus approximated by reducing, at each transmission, the increase of an anticipated version of the completion time. The paper solves the problem by formulating it as a maximum weight clique problem over a newly designed rate aware IDNC (RA-IDNC) graph. The highest weight clique in the created graph being potentially not unique, the paper further suggests a multi-layer version of the proposed solution to improve the obtained results from the employed completion time approximation. Simulation results indicate that the cross-layer design largely outperforms the uncoded transmissions strategies and the classical IDNC scheme.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/TWC.2016.2635638DOIArticle
http://ieeexplore.ieee.org/document/7769211/PublisherArticle
ORCID:
AuthorORCID
Douik, Ahmed0000-0001-7791-9443
Sorour, Sameh0000-0002-3936-7833
Al-Naffouri, Tareq Y.0000-0001-6955-4720
Alouini, Mohamed-Slim0000-0003-4827-1793
Additional Information:© 2016 IEEE. A part of this paper [1] is published in IEEE Global Telecommunications Conference Workshop (GLOBECOM’ 2015), San Diego, California, USA.
Subject Keywords:Instantly decodable network coding, rate adaptation, completion time reduction, graph theory, maximum weight clique
Issue or Number:2
Record Number:CaltechAUTHORS:20170111-141802237
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170111-141802237
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:73441
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:20 Jan 2017 07:10
Last Modified:09 Mar 2020 13:18

Repository Staff Only: item control page