Critical Density Thresholds in Distributed Wireless Networks

  • Bhaskar Krishnamachari
  • Stephen B. Wicker
  • Rámon Béjar
  • Marc Pearlman
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 712)


Experimental and analytical results showing “zero-one” phase transitions for network connectivity, multi-path reliability, neighbor count, Hamiltonian cycle formation, multiple-clique formation, and probabilistic flooding are presented. These transitions are characterized by critical density thresholds such that a global property exists with negligible probability on one side of the threshold, and exists with high probability on the other. The connections between these phase transitions and some known results on random graphs are discussed, and their significance for the design of resource-efficient wireless networks is indicated.


Wireless Network Random Graph Hamiltonian Cycle Network Security Random Graph Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. Bejar, B. Krishnamachari, C. Gomes, B. Selman, “Distributed Constraint Satisfaction in a Wireless Sensor Tracking System,” Workshop on Distributed Constraint Reasoning, International Joint Conference on Artificial Intelligence, Seattle, Washington, August 2001.Google Scholar
  2. [2]
    K. Birman et al., “Bimodal Multicast,” ACM Transactions on Computer Systems, Volume 17, No. 2., May 1999.Google Scholar
  3. [3]
    B. Bollobás, Random Graphs, Academic Press, 1985.zbMATHGoogle Scholar
  4. [4]
    J. C. Cano, and P. Manzoni, “A low power protocol to broadcast real-time data traffic in a clustered ad hoc network,” IEEE GlobeCom 2001, November 2001.Google Scholar
  5. [5]
    R. Chandra, V. Ramasubramanian, and K. P. Birman, “Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Net- works”, International Conference on Distributed Computing Systems, 2001.Google Scholar
  6. [6]
    P. Cheeseman and B. Kanefsky and W. M. Taylor, “Where the really hard problems are,” IJCAI-91, Vol. 1, pp. 331–7, 1991.Google Scholar
  7. [7]
    J. Frank and C. Martel, “Phase transitions in the properties of random graphs,” Principles and Practice of Constraint Programming (CP-95), Cassis, France, 1995.Google Scholar
  8. [8]
    P. Gupta and P. R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” in Stochastic Analysis, Control, Optimization and Applications, Eds. W.M. McEneany et al., Birkhauser, Boston, p. 547–566, 1998.Google Scholar
  9. [9]
    S. A. Kauffman, The Origins of Order: Self-organization and Selection in Evolution, Oxford University Press, 1993.Google Scholar
  10. [10]
    S. Kirkpatrick and B. Selman, “Critical behavior in the satisfiability of random Boolean expressions,” Science Vol. 264, no. 5163, pp. 1297–1301, May 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  11. [11]
    B. Krishnamachari, S. B. Wicker, and R. Bejar, “Phase Transitions in Wireless Ad-Hoc Networks,” IEEE GlobeCom 2001, November 2001.Google Scholar
  12. [12]
    B. Krishnamachari, R. Bejar, and S. B. Wicker, “Distributed Constraint Satisfaction and the Bounds on Resource Allocation in Wireless Networks,” Sixth International Symposium on Communications Theory and Application (ISCTA ‘01), Ambleside, UK, July 2001Google Scholar
  13. [13]
    B. Krishnamachari, R. Bejar, and S. B. Wicker, “Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-hop Wireless Networks,” 35th Hawaii International Conference on System Sciences, January 2002.Google Scholar
  14. [14]
    L. Li, J. Halpern, Z. J. Haas, “Gossip-based Ad Hoc Routing,” unpublished.Google Scholar
  15. [15]
    N. A. Lynch, Distributed Algorithms, Morgan Kauffman Publishers, 1996.zbMATHGoogle Scholar
  16. [16]
    R. Meester, and R. Roy, Continuum Percolation, Cambridge University Press, 1996.zbMATHCrossRefGoogle Scholar
  17. [17]
    M. R. Pearlman, Z. J. Haas, P. Scholander, and S. S. Tabrizi, “On the Impact of Alternate Path Routing for Load Balancing in Mobile Ad Hoc Networks,” ACM MobiHOC’2000, Boston, MA, August 11, 2000Google Scholar
  18. [18]
    C. Perkins (Ed.), Ad Hoc Networking, Addison-Wesley Publishing Co., 2000.Google Scholar
  19. [19]
    M. Sanchez, P. Manzoni and Z. J. Haas, “Determination of Critical Transmission Range in Ad-Hoc Networks,” Multiaccess Mobility and Teletraffic for Wireless Communications Workshop (MMT’99), Venice, Italy, October 1999.Google Scholar
  20. [20]
    M. Seddigh and J. S. Gonzales and I. Stojmenovic, “RNG and internal node based broadcasting algorithms for wireless one-to-one networks,” ACM Mobile Computing and Communications Review, Vol. 5, No. 2, pp. 394–397, 2001.CrossRefGoogle Scholar
  21. [21]
    J. Spencer, Ten Lectures on the Probabilistic Method, SIAM, 1987.zbMATHGoogle Scholar
  22. [22]
    A. Tsirigos, Z.J. Haas, and S. Tabrizi, “Multipath Routing in Mobile Ad Hoc Networks or How to Route in the Presence of Topological Changes,” IEEE MILCOM’2001, Tysons Corner,VA, October 28–31, 2001Google Scholar
  23. [23]
    C. K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice Hall, 2001.Google Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Bhaskar Krishnamachari
    • 1
  • Stephen B. Wicker
    • 1
  • Rámon Béjar
    • 1
  • Marc Pearlman
    • 1
  1. 1.Cornell UniversityIthacaUSA

Personalised recommendations