skip to main content
10.1145/1143549.1143795acmconferencesArticle/Chapter ViewAbstractPublication PagesiwcmcConference Proceedingsconference-collections
Article

Capacity analysis of maximal flow in ad hoc networks

Published: 03 July 2006 Publication History

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.

References

[1]
R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung. Network information flow. IEEE Trans. Inform. Theory, 46:1204--1216, July 2000.
[2]
B. Bollobas. Modern Graph Theory. Springer-Verlag, 2000.
[3]
B. Bollobas. Random Graphs. Cambridge University Press, 2001.
[4]
P. Fan, G. Li, K. Cai, and K. Letaief. On the geometrical characteristic of wireless ad-hoc networks and its application in network performance analysis. Accepted by IEEE Transactions on Wireless Communications, November 2005.
[5]
L. Ford and D. Fulkerson. Maximal flow through a network. Can. Journal of Mathematics., pages 399--404, 1956.
[6]
D. Karger. Random sampling in cut, flow, and network design problems. Mathematics of Operations Research, 24(2):383--413, May 1999.
[7]
A. Karzanov. Determining the maximal flow in a network by the method of preflows. Sov. Math. Dokl, 1974.
[8]
R. Koetter and M. Medard. An algebraic approach to network coding. IEEE/ACM Trans. Networking, 11(5):782--795, October 2003.
[9]
G. Li, P. Fan, and K. Cai. On geometrical characteristic of three-dimension wireless ad-hoc networks and its application. Accepted by EURASIP Journal on Wireless Communications and Networking, November 2005.
[10]
S.-Y. Li, R. Yeung, and N. Cai. Linear network coding. IEEE Trans. Inform. Theory, 49(2):371--381, February 2003.
[11]
A. Papoulis and S. Pillai. Probability, Random Variables and Stochastic Processes. McGraw-Hill Companies, 2002.
[12]
A. Ramamoorthy, J. Shi, and R. Wesel. On the capacity of network coding for random networks. Allerton Conference on Communication, Control and Computing, 2003.
[13]
D. Reinhard. Graph Theory. Springer-Verlag, 1991.
[14]
H. Wang, P. Fan, and K. Letaief. Maximum flow and network capacity of network coding for ad hoc networks. revised manuscript to IEEE Transactions on wireless Communications, December 2005.

Index Terms

  1. Capacity analysis of maximal flow in ad hoc networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computing
    July 2006
    2006 pages
    ISBN:1595933069
    DOI:10.1145/1143549
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 03 July 2006

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. max-flow min-cut
    2. network capacity
    3. network coding
    4. random graph
    5. routing

    Qualifiers

    • Article

    Conference

    IWCMC06
    Sponsor:

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 287
      Total Downloads
    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 17 Feb 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media