Universal opportunistic routing scheme using network coding

Abdallah Khreishah, Issa Khalil, Jie Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

Recent research has shown that the performance of opportunistic routing and network coding in wireless networks is greatly impacted by the correlation among the links. However, it is difficult to measure the correlation among the links, especially because of the time-varying behavior of the wireless links. Therefore, it is crucial to design a distributed algorithm that does not require the explicit knowledge of the channels' states and can adapt to the varying channel conditions. In this paper, 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
Title of host publicationAnnual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops
Pages353-361
Number of pages9
Volume1
DOIs
Publication statusPublished - 1 Nov 2012
Externally publishedYes
Event2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2012 - Seoul, Korea, Republic of
Duration: 18 Jun 201221 Jun 2012

Other

Other2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2012
CountryKorea, Republic of
CitySeoul
Period18/6/1221/6/12

Fingerprint

Network coding
Feedback
Parallel algorithms
Telecommunication links
Redundancy
Wireless networks
Throughput

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Khreishah, A., Khalil, I., & Wu, J. (2012). Universal opportunistic routing scheme using network coding. In Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops (Vol. 1, pp. 353-361). [6275797] https://doi.org/10.1109/SECON.2012.6275797

Universal opportunistic routing scheme using network coding. / Khreishah, Abdallah; Khalil, Issa; Wu, Jie.

Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops. Vol. 1 2012. p. 353-361 6275797.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khreishah, A, Khalil, I & Wu, J 2012, Universal opportunistic routing scheme using network coding. in Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops. vol. 1, 6275797, pp. 353-361, 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2012, Seoul, Korea, Republic of, 18/6/12. https://doi.org/10.1109/SECON.2012.6275797
Khreishah A, Khalil I, Wu J. Universal opportunistic routing scheme using network coding. In Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops. Vol. 1. 2012. p. 353-361. 6275797 https://doi.org/10.1109/SECON.2012.6275797
Khreishah, Abdallah ; Khalil, Issa ; Wu, Jie. / Universal opportunistic routing scheme using network coding. Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops. Vol. 1 2012. pp. 353-361
@inproceedings{bfc895252ec44ffead5deb3ef1c928b7,
title = "Universal opportunistic routing scheme using network coding",
abstract = "Recent research has shown that the performance of opportunistic routing and network coding in wireless networks is greatly impacted by the correlation among the links. However, it is difficult to measure the correlation among the links, especially because of the time-varying behavior of the wireless links. Therefore, it is crucial to design a distributed algorithm that does not require the explicit knowledge of the channels' states and can adapt to the varying channel conditions. In this paper, 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, Network coding, wireless networks",
author = "Abdallah Khreishah and Issa Khalil and Jie Wu",
year = "2012",
month = "11",
day = "1",
doi = "10.1109/SECON.2012.6275797",
language = "English",
isbn = "9781467319058",
volume = "1",
pages = "353--361",
booktitle = "Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops",

}

TY - GEN

T1 - Universal opportunistic routing scheme using network coding

AU - Khreishah, Abdallah

AU - Khalil, Issa

AU - Wu, Jie

PY - 2012/11/1

Y1 - 2012/11/1

N2 - Recent research has shown that the performance of opportunistic routing and network coding in wireless networks is greatly impacted by the correlation among the links. However, it is difficult to measure the correlation among the links, especially because of the time-varying behavior of the wireless links. Therefore, it is crucial to design a distributed algorithm that does not require the explicit knowledge of the channels' states and can adapt to the varying channel conditions. In this paper, 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 - Recent research has shown that the performance of opportunistic routing and network coding in wireless networks is greatly impacted by the correlation among the links. However, it is difficult to measure the correlation among the links, especially because of the time-varying behavior of the wireless links. Therefore, it is crucial to design a distributed algorithm that does not require the explicit knowledge of the channels' states and can adapt to the varying channel conditions. In this paper, 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 - Network coding

KW - wireless networks

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

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

U2 - 10.1109/SECON.2012.6275797

DO - 10.1109/SECON.2012.6275797

M3 - Conference contribution

SN - 9781467319058

VL - 1

SP - 353

EP - 361

BT - Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops

ER -