Maximum flow and network capacity of network coding for ad-hoc networks

Hongzheng Wang, Pingyi Fan, Khaled Letaief

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

Network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks based on random graph models. Theoretical analysis shows that the maximum flow can be modelled as extreme order statistics of Gaussian distribution for both wired and wireless ad-hoc networks as the node number is relatively large under a certain condition. We also investigate the effects of the nodes' covering capabilities on the capacity of network coding.

Original languageEnglish
Pages (from-to)4193-4198
Number of pages6
JournalIEEE Transactions on Wireless Communications
Volume6
Issue number12
DOIs
Publication statusPublished - Dec 2007
Externally publishedYes

Fingerprint

Maximum Flow
Network coding
Network Coding
Ad hoc networks
Ad Hoc Networks
Extreme Order Statistics
Wireless Ad Hoc Networks
Wireless ad hoc networks
Gaussian distribution
Graph Model
Vertex of a graph
Multicast
Random Graphs
Statistical property
Theoretical Analysis
Covering
Statistics

Keywords

  • Extreme order statistics
  • Max-flow mincut
  • Network capacity
  • Network coding
  • Random graph

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Networks and Communications

Cite this

Maximum flow and network capacity of network coding for ad-hoc networks. / Wang, Hongzheng; Fan, Pingyi; Letaief, Khaled.

In: IEEE Transactions on Wireless Communications, Vol. 6, No. 12, 12.2007, p. 4193-4198.

Research output: Contribution to journalArticle

@article{8109d360865d4899a93db3d1841e0338,
title = "Maximum flow and network capacity of network coding for ad-hoc networks",
abstract = "Network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks based on random graph models. Theoretical analysis shows that the maximum flow can be modelled as extreme order statistics of Gaussian distribution for both wired and wireless ad-hoc networks as the node number is relatively large under a certain condition. We also investigate the effects of the nodes' covering capabilities on the capacity of network coding.",
keywords = "Extreme order statistics, Max-flow mincut, Network capacity, Network coding, Random graph",
author = "Hongzheng Wang and Pingyi Fan and Khaled Letaief",
year = "2007",
month = "12",
doi = "10.1109/TWC.2007.05499",
language = "English",
volume = "6",
pages = "4193--4198",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - Maximum flow and network capacity of network coding for ad-hoc networks

AU - Wang, Hongzheng

AU - Fan, Pingyi

AU - Letaief, Khaled

PY - 2007/12

Y1 - 2007/12

N2 - Network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks based on random graph models. Theoretical analysis shows that the maximum flow can be modelled as extreme order statistics of Gaussian distribution for both wired and wireless ad-hoc networks as the node number is relatively large under a certain condition. We also investigate the effects of the nodes' covering capabilities on the capacity of network coding.

AB - Network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks based on random graph models. Theoretical analysis shows that the maximum flow can be modelled as extreme order statistics of Gaussian distribution for both wired and wireless ad-hoc networks as the node number is relatively large under a certain condition. We also investigate the effects of the nodes' covering capabilities on the capacity of network coding.

KW - Extreme order statistics

KW - Max-flow mincut

KW - Network capacity

KW - Network coding

KW - Random graph

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

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

U2 - 10.1109/TWC.2007.05499

DO - 10.1109/TWC.2007.05499

M3 - Article

AN - SCOPUS:37049007400

VL - 6

SP - 4193

EP - 4198

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 12

ER -