By Topic

Analysis of maximum flow in random graphs for network coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hongzheng Wang ; Dept. of Electron. Eng., Tsinghua Univ., Beijing, China ; Pingyi Fan ; Zhigang Cao

Network coding is an essential way to achieve the maximum flow of multicast networks. Recent results have shown that random graph theory has a heuristic role in guiding the construction of network coding. In this paper, we study the distribution of maximum flow in different random graph models. We show that in a n nodes network with sampling probability p the mean of any s-t maximum flow is about (n-1)p-√((n-1)pq/π). In a n nodes random geometric graph, a model for wireless network, we can get similar results as long as the parameter has corresponding value to the one in random graph model. We also show that the changing of connectivity radius would affect the maximum flow significantly.

Published in:

2005 IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications  (Volume:2 )

Date of Conference:

8-12 Aug. 2005