Network coding for efficient multicast routing in wireless ad-hoc networks

Jingyao Zhang, Pingyi Fan, Khaled Letaief

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networks such as ad-hoc and sensor networks. In this work, we investigate the multicast routing problem based on network coding and put forward a practical algorithm to obtain the maximum flow multicast routes in ad-hoc networks. The "conflict phenomenon" that occurs in undirected graphs will also be discussed. Given the developed routing algorithm, we will present the condition for a node to be an encoding node along with a corresponding capacity allocation scheme. We will also analyze the statistical characteristics of encoding nodes and maximum flow in ad-hoc networks based on random graph theory.

Original languageEnglish
Pages (from-to)598-607
Number of pages10
JournalIEEE Transactions on Communications
Volume56
Issue number4
DOIs
Publication statusPublished - Apr 2008
Externally publishedYes

Fingerprint

Network coding
Wireless ad hoc networks
Ad hoc networks
Graph theory
Routing algorithms
Sensor networks

Keywords

  • Adhoc networks
  • Encoding nodes
  • Multicast
  • Network coding
  • Random graph

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Network coding for efficient multicast routing in wireless ad-hoc networks. / Zhang, Jingyao; Fan, Pingyi; Letaief, Khaled.

In: IEEE Transactions on Communications, Vol. 56, No. 4, 04.2008, p. 598-607.

Research output: Contribution to journalArticle

@article{4a0ab3551cbb4bebb1598619a72b4b3f,
title = "Network coding for efficient multicast routing in wireless ad-hoc networks",
abstract = "Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networks such as ad-hoc and sensor networks. In this work, we investigate the multicast routing problem based on network coding and put forward a practical algorithm to obtain the maximum flow multicast routes in ad-hoc networks. The {"}conflict phenomenon{"} that occurs in undirected graphs will also be discussed. Given the developed routing algorithm, we will present the condition for a node to be an encoding node along with a corresponding capacity allocation scheme. We will also analyze the statistical characteristics of encoding nodes and maximum flow in ad-hoc networks based on random graph theory.",
keywords = "Adhoc networks, Encoding nodes, Multicast, Network coding, Random graph",
author = "Jingyao Zhang and Pingyi Fan and Khaled Letaief",
year = "2008",
month = "4",
doi = "10.1109/TCOMM.2008.060238",
language = "English",
volume = "56",
pages = "598--607",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Network coding for efficient multicast routing in wireless ad-hoc networks

AU - Zhang, Jingyao

AU - Fan, Pingyi

AU - Letaief, Khaled

PY - 2008/4

Y1 - 2008/4

N2 - Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networks such as ad-hoc and sensor networks. In this work, we investigate the multicast routing problem based on network coding and put forward a practical algorithm to obtain the maximum flow multicast routes in ad-hoc networks. The "conflict phenomenon" that occurs in undirected graphs will also be discussed. Given the developed routing algorithm, we will present the condition for a node to be an encoding node along with a corresponding capacity allocation scheme. We will also analyze the statistical characteristics of encoding nodes and maximum flow in ad-hoc networks based on random graph theory.

AB - Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networks such as ad-hoc and sensor networks. In this work, we investigate the multicast routing problem based on network coding and put forward a practical algorithm to obtain the maximum flow multicast routes in ad-hoc networks. The "conflict phenomenon" that occurs in undirected graphs will also be discussed. Given the developed routing algorithm, we will present the condition for a node to be an encoding node along with a corresponding capacity allocation scheme. We will also analyze the statistical characteristics of encoding nodes and maximum flow in ad-hoc networks based on random graph theory.

KW - Adhoc networks

KW - Encoding nodes

KW - Multicast

KW - Network coding

KW - Random graph

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

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

U2 - 10.1109/TCOMM.2008.060238

DO - 10.1109/TCOMM.2008.060238

M3 - Article

AN - SCOPUS:49049113677

VL - 56

SP - 598

EP - 607

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 4

ER -