Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
K. Birman et al., “Bimodal Multicast,” ACM Transactions on Computer Systems, Volume 17, No. 2., May 1999.
B. Bollobás, Random Graphs, Academic Press, 1985.
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.
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.
P. Cheeseman and B. Kanefsky and W. M. Taylor, “Where the really hard problems are,” IJCAI-91, Vol. 1, pp. 331–7, 1991.
J. Frank and C. Martel, “Phase transitions in the properties of random graphs,” Principles and Practice of Constraint Programming (CP-95), Cassis, France, 1995.
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.
S. A. Kauffman, The Origins of Order: Self-organization and Selection in Evolution, Oxford University Press, 1993.
S. Kirkpatrick and B. Selman, “Critical behavior in the satisfiability of random Boolean expressions,” Science Vol. 264, no. 5163, pp. 1297–1301, May 1994.
B. Krishnamachari, S. B. Wicker, and R. Bejar, “Phase Transitions in Wireless Ad-Hoc Networks,” IEEE GlobeCom 2001, November 2001.
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 2001
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.
L. Li, J. Halpern, Z. J. Haas, “Gossip-based Ad Hoc Routing,” unpublished.
N. A. Lynch, Distributed Algorithms, Morgan Kauffman Publishers, 1996.
R. Meester, and R. Roy, Continuum Percolation, Cambridge University Press, 1996.
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, 2000
C. Perkins (Ed.), Ad Hoc Networking, Addison-Wesley Publishing Co., 2000.
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.
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.
J. Spencer, Ten Lectures on the Probabilistic Method, SIAM, 1987.
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, 2001
C. K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice Hall, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Krishnamachari, B., Wicker, S.B., Béjar, R., Pearlman, M. (2003). Critical Density Thresholds in Distributed Wireless Networks. In: Bhargava, V.K., Poor, H.V., Tarokh, V., Yoon, S. (eds) Communications, Information and Network Security. The Springer International Series in Engineering and Computer Science, vol 712. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3789-9_14
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3789-9_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5318-6
Online ISBN: 978-1-4757-3789-9
eBook Packages: Springer Book Archive