CaltechAUTHORS
  A Caltech Library Service

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

Douik, Ahmed and Sorour, Sameh and Al-Naffouri, Tareq Y. and Alouini, Mohamed-Slim (2017) Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications. IEEE Communications Surveys & Tutorials, 19 (2). pp. 1201-1224. ISSN 1553-877X. https://resolver.caltech.edu/CaltechAUTHORS:20170208-163038003

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:20170208-163038003

Abstract

From its introduction to its quindecennial, network coding has built a strong reputation for enhancing packet recovery and achieving maximum information flow in both wired and wireless networks. Traditional studies focused on optimizing the throughput of the system by proposing elaborate schemes able to reach the network capacity. With the shift toward distributed computing on mobile devices, performance and complexity become both critical factors that affect the efficiency of a coding strategy. Instantly decodable network coding presents itself as a new paradigm in network coding that trades off these two aspects. This paper review instantly decodable network coding schemes by identifying, categorizing, and evaluating various algorithms proposed in the literature. The first part of the manuscript investigates the conventional centralized systems, in which all decisions are carried out by a central unit, e.g., a base-station. In particular, two successful approaches known as the strict and generalized instantly decodable network are compared in terms of reliability, performance, complexity, and packet selection methodology. The second part considers the use of instantly decodable codes in a device-to-device communication network, in which devices speed up the recovery of the missing packets by exchanging network coded packets. Although the performance improvements are directly proportional to the computational complexity increases, numerous successful schemes from both the performance and complexity viewpoints are identified.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/COMST.2017.2665587DOIArticle
http://ieeexplore.ieee.org/document/7845689/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:© 2017 IEEE. Manuscript received April 17, 2016; revised November 17, 2016; accepted January 17, 2017. Date of publication February 7, 2017; date of current version May 31, 2017. The authors wish to thank Professor Parastoo Sadeghi for her helpful comments and suggestions.
Subject Keywords:Strict and generalized instantly decodable network coding, completion time, decoding delay, graph theory, maximum weight clique problem, distributed optimization, device-to-device, cooperative data exchange, game theory
Issue or Number:2
Record Number:CaltechAUTHORS:20170208-163038003
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170208-163038003
Official Citation:A. Douik, S. Sorour, T. Y. Al-Naffouri and M. S. Alouini, "Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications," in IEEE Communications Surveys & Tutorials, vol. 19, no. 2, pp. 1201-1224, Secondquarter 2017. doi: 10.1109/COMST.2017.2665587 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7845689&isnumber=7936707
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:74181
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:09 Feb 2017 02:42
Last Modified:09 Mar 2020 13:18

Repository Staff Only: item control page