Universal network coding-based opportunistic routing for unicast

Abdallah Khreishah, Issa Khalil, Jie Wu

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Network coding-based opportunistic routing has emerged as an elegant way to optimize the capacity of lossy wireless multihop networks by reducing the amount of required feedback messages. Most of the works on network coding-based opportunistic routing in the literature assume that the links are independent. This assumption has been invalidated by the recent empirical studies that showed that the correlation among the links can be arbitrary. In this work, we show that the performance of network coding-based opportunistic routing is greatly impacted by the correlation among the links. We formulate the problem of maximizing the throughput while achieving fairness under arbitrary channel conditions, and we identify the structure of its optimal solution. As is typical in the literature, the optimal solution requires a large amount of immediate feedback messages, which is unrealistic. We propose the idea of performing network coding on the feedback messages and show that if the intermediate node waits until receiving only one feedback message from each next-hop node, the optimal level of network coding redundancy can be computed in a distributed manner. The coded feedback messages require a small amount of overhead, as they can be integrated with the packets. Our approach is also oblivious to losses and correlations among the links, as it optimizes the performance without the explicit knowledge of these two factors.

Original languageEnglish
Article number6812230
Pages (from-to)1765-1774
Number of pages10
JournalIEEE Transactions on Parallel and Distributed Systems
Volume26
Issue number6
DOIs
Publication statusPublished - 1 Jun 2015

Fingerprint

Network coding
Feedback
Redundancy
Wireless networks
Throughput

Keywords

  • coded feedback
  • cross-layer design
  • feedback
  • link correlation
  • Network coding
  • wireless networks

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Computational Theory and Mathematics

Cite this

Universal network coding-based opportunistic routing for unicast. / Khreishah, Abdallah; Khalil, Issa; Wu, Jie.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 26, No. 6, 6812230, 01.06.2015, p. 1765-1774.

Research output: Contribution to journalArticle

@article{4a9ae70247ae462fb54a93ca03487228,
title = "Universal network coding-based opportunistic routing for unicast",
abstract = "Network coding-based opportunistic routing has emerged as an elegant way to optimize the capacity of lossy wireless multihop networks by reducing the amount of required feedback messages. Most of the works on network coding-based opportunistic routing in the literature assume that the links are independent. This assumption has been invalidated by the recent empirical studies that showed that the correlation among the links can be arbitrary. In this work, we show that the performance of network coding-based opportunistic routing is greatly impacted by the correlation among the links. We formulate the problem of maximizing the throughput while achieving fairness under arbitrary channel conditions, and we identify the structure of its optimal solution. As is typical in the literature, the optimal solution requires a large amount of immediate feedback messages, which is unrealistic. We propose the idea of performing network coding on the feedback messages and show that if the intermediate node waits until receiving only one feedback message from each next-hop node, the optimal level of network coding redundancy can be computed in a distributed manner. The coded feedback messages require a small amount of overhead, as they can be integrated with the packets. Our approach is also oblivious to losses and correlations among the links, as it optimizes the performance without the explicit knowledge of these two factors.",
keywords = "coded feedback, cross-layer design, feedback, link correlation, Network coding, wireless networks",
author = "Abdallah Khreishah and Issa Khalil and Jie Wu",
year = "2015",
month = "6",
day = "1",
doi = "10.1109/TPDS.2014.2322617",
language = "English",
volume = "26",
pages = "1765--1774",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "6",

}

TY - JOUR

T1 - Universal network coding-based opportunistic routing for unicast

AU - Khreishah, Abdallah

AU - Khalil, Issa

AU - Wu, Jie

PY - 2015/6/1

Y1 - 2015/6/1

N2 - Network coding-based opportunistic routing has emerged as an elegant way to optimize the capacity of lossy wireless multihop networks by reducing the amount of required feedback messages. Most of the works on network coding-based opportunistic routing in the literature assume that the links are independent. This assumption has been invalidated by the recent empirical studies that showed that the correlation among the links can be arbitrary. In this work, we show that the performance of network coding-based opportunistic routing is greatly impacted by the correlation among the links. We formulate the problem of maximizing the throughput while achieving fairness under arbitrary channel conditions, and we identify the structure of its optimal solution. As is typical in the literature, the optimal solution requires a large amount of immediate feedback messages, which is unrealistic. We propose the idea of performing network coding on the feedback messages and show that if the intermediate node waits until receiving only one feedback message from each next-hop node, the optimal level of network coding redundancy can be computed in a distributed manner. The coded feedback messages require a small amount of overhead, as they can be integrated with the packets. Our approach is also oblivious to losses and correlations among the links, as it optimizes the performance without the explicit knowledge of these two factors.

AB - Network coding-based opportunistic routing has emerged as an elegant way to optimize the capacity of lossy wireless multihop networks by reducing the amount of required feedback messages. Most of the works on network coding-based opportunistic routing in the literature assume that the links are independent. This assumption has been invalidated by the recent empirical studies that showed that the correlation among the links can be arbitrary. In this work, we show that the performance of network coding-based opportunistic routing is greatly impacted by the correlation among the links. We formulate the problem of maximizing the throughput while achieving fairness under arbitrary channel conditions, and we identify the structure of its optimal solution. As is typical in the literature, the optimal solution requires a large amount of immediate feedback messages, which is unrealistic. We propose the idea of performing network coding on the feedback messages and show that if the intermediate node waits until receiving only one feedback message from each next-hop node, the optimal level of network coding redundancy can be computed in a distributed manner. The coded feedback messages require a small amount of overhead, as they can be integrated with the packets. Our approach is also oblivious to losses and correlations among the links, as it optimizes the performance without the explicit knowledge of these two factors.

KW - coded feedback

KW - cross-layer design

KW - feedback

KW - link correlation

KW - Network coding

KW - wireless networks

UR - http://www.scopus.com/inward/record.url?scp=84929346536&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84929346536&partnerID=8YFLogxK

U2 - 10.1109/TPDS.2014.2322617

DO - 10.1109/TPDS.2014.2322617

M3 - Article

VL - 26

SP - 1765

EP - 1774

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 6

M1 - 6812230

ER -