Capacity analysis of maximal flow in ad hoc networks

Authors:
Jingtao Yu;Pingyi Fan;Kai Cai
Affiliations:
Tsinghua University, Beijing, P.R. China;Tsinghua University, Beijing, P.R. China;Tsinghua University, Beijing, P.R. China
Venue:
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Year:
2006

Citing 6
Cited 0

Random Sampling in Cut, Flow, and Network Design Problems

Mathematics of Operations Research
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
On the Geometrical Characteristic of Wireless Ad-Hoc Networks and its Application in Network Performance Analysis

IEEE Transactions on Wireless Communications
Maximum flow and network capacity of network coding for ad-hoc networks

IEEE Transactions on Wireless Communications
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Capacity Analysis of network coding is a fundamental problem in communication networks. In this paper, we investigate this problem by generalizing the conventional random graph model as G(n, P,C), where the connecting probability between each pair of nodes p obeys an independent and identical distribution and all the links each have an independent and identical transmission capacity distribution. A tight upper bound of the average value of the maximal flow will be derived based on the proposed random graph model. Moreover, the averaged value and the variance of the maximal flow shall be investigated by some simulations, which demonstrate the effectiveness of our theoretical analysis.