Congestion-aware network-coding-based opportunistic routing in wireless ad hoc networks

Kun Cheng Chung, Hsinchun Chen, Wanjiun Liao

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

5 Citations (Scopus)

Abstract

In this paper, we propose a congestion-aware network-coding-based opportunistic routing mechanism called CONCOR for wireless ad hoc networks. An existing mechanism called MORE shows good throughput in the single flow case; however, it suffers significant performance degradation in scenarios with multiple traffic flows due to the redundant transmission problem and the unbalanced load problem. To tackle these two problems, our proposed CONCOR contains two key components, namely, null space feedback and rank differential, which allows feedback of the received random network coding information with minimal overhead among neighboring nodes and enables a backpressure policy to balance the load along the path. The simulation results show that CONCOR outperforms MORE in all cases, even in the single flow scenario. Specifically, compared with MORE, CONCOR has better throughput due to fewer redundant transmissions and more equitable treatment of multiple competing flows.

Original languageEnglish (US)
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
StatePublished - 2011
Externally publishedYes
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: Dec 5 2011Dec 9 2011

Other

Other54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
CountryUnited States
CityHouston, TX
Period12/5/1112/9/11

Fingerprint

Network coding
Wireless ad hoc networks
Throughput
Feedback
Degradation

Keywords

  • congestion-aware, wireless ad hoc netowkrs
  • network coding
  • opportunistic routing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Chung, K. C., Chen, H., & Liao, W. (2011). Congestion-aware network-coding-based opportunistic routing in wireless ad hoc networks. In GLOBECOM - IEEE Global Telecommunications Conference [6133735] https://doi.org/10.1109/GLOCOM.2011.6133735

Congestion-aware network-coding-based opportunistic routing in wireless ad hoc networks. / Chung, Kun Cheng; Chen, Hsinchun; Liao, Wanjiun.

GLOBECOM - IEEE Global Telecommunications Conference. 2011. 6133735.

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

Chung, KC, Chen, H & Liao, W 2011, Congestion-aware network-coding-based opportunistic routing in wireless ad hoc networks. in GLOBECOM - IEEE Global Telecommunications Conference., 6133735, 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011, Houston, TX, United States, 12/5/11. https://doi.org/10.1109/GLOCOM.2011.6133735
Chung, Kun Cheng ; Chen, Hsinchun ; Liao, Wanjiun. / Congestion-aware network-coding-based opportunistic routing in wireless ad hoc networks. GLOBECOM - IEEE Global Telecommunications Conference. 2011.
@inproceedings{712e46c9628e48158426992d3f53365b,
title = "Congestion-aware network-coding-based opportunistic routing in wireless ad hoc networks",
abstract = "In this paper, we propose a congestion-aware network-coding-based opportunistic routing mechanism called CONCOR for wireless ad hoc networks. An existing mechanism called MORE shows good throughput in the single flow case; however, it suffers significant performance degradation in scenarios with multiple traffic flows due to the redundant transmission problem and the unbalanced load problem. To tackle these two problems, our proposed CONCOR contains two key components, namely, null space feedback and rank differential, which allows feedback of the received random network coding information with minimal overhead among neighboring nodes and enables a backpressure policy to balance the load along the path. The simulation results show that CONCOR outperforms MORE in all cases, even in the single flow scenario. Specifically, compared with MORE, CONCOR has better throughput due to fewer redundant transmissions and more equitable treatment of multiple competing flows.",
keywords = "congestion-aware, wireless ad hoc netowkrs, network coding, opportunistic routing",
author = "Chung, {Kun Cheng} and Hsinchun Chen and Wanjiun Liao",
year = "2011",
doi = "10.1109/GLOCOM.2011.6133735",
language = "English (US)",
isbn = "9781424492688",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Congestion-aware network-coding-based opportunistic routing in wireless ad hoc networks

AU - Chung, Kun Cheng

AU - Chen, Hsinchun

AU - Liao, Wanjiun

PY - 2011

Y1 - 2011

N2 - In this paper, we propose a congestion-aware network-coding-based opportunistic routing mechanism called CONCOR for wireless ad hoc networks. An existing mechanism called MORE shows good throughput in the single flow case; however, it suffers significant performance degradation in scenarios with multiple traffic flows due to the redundant transmission problem and the unbalanced load problem. To tackle these two problems, our proposed CONCOR contains two key components, namely, null space feedback and rank differential, which allows feedback of the received random network coding information with minimal overhead among neighboring nodes and enables a backpressure policy to balance the load along the path. The simulation results show that CONCOR outperforms MORE in all cases, even in the single flow scenario. Specifically, compared with MORE, CONCOR has better throughput due to fewer redundant transmissions and more equitable treatment of multiple competing flows.

AB - In this paper, we propose a congestion-aware network-coding-based opportunistic routing mechanism called CONCOR for wireless ad hoc networks. An existing mechanism called MORE shows good throughput in the single flow case; however, it suffers significant performance degradation in scenarios with multiple traffic flows due to the redundant transmission problem and the unbalanced load problem. To tackle these two problems, our proposed CONCOR contains two key components, namely, null space feedback and rank differential, which allows feedback of the received random network coding information with minimal overhead among neighboring nodes and enables a backpressure policy to balance the load along the path. The simulation results show that CONCOR outperforms MORE in all cases, even in the single flow scenario. Specifically, compared with MORE, CONCOR has better throughput due to fewer redundant transmissions and more equitable treatment of multiple competing flows.

KW - congestion-aware, wireless ad hoc netowkrs

KW - network coding

KW - opportunistic routing

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

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

U2 - 10.1109/GLOCOM.2011.6133735

DO - 10.1109/GLOCOM.2011.6133735

M3 - Conference contribution

AN - SCOPUS:84863136828

SN - 9781424492688

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -