Robust network connectivity: When it's the big picture that matters

Performance Evaluation Review

Volumn 34, Issue 1, 2006, Pages 299-310

  Peserico, Enoch ^a   Rudolph, Larry ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Ad hoc; Connectivity; Fault; Network; Percolation; Random; Resilient; Topology

Indexed keywords

AD HOC NETWORKS; FAULTS; PERCOLATION; RESILIENT;

COMPUTER SYSTEM RECOVERY; FAULT TOLERANT COMPUTER SYSTEMS; PROBABILITY; RANDOM PROCESSES; TOPOLOGY;

COMPUTER NETWORKS;

EID: 33750336267     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/1140103.1140312     Document Type: Conference Paper

References (25)

1. B. Bollobas and F. Chung. The diameter of a cycle plus a random matching. SIAM Journal on Discrete Mathematics, 1:328-333, 1988.
2. L. Booth, J. Bruck, M. Pranceschetti, and R. Meester. Continuum percolation and the geometry of wireless networks. Annals of Applied Probability, 13(2):722-731, 2003.
3. O. Dousse and P. Thiran. Connectivity vs capacity in dense ad hoc networks. In Proceedings of IEEE INFOCOM, 2004.
4. O. Dousse, P. Thiran, and M. Hasler. Connectivity in ad-hoc and hybrid networks. In Proceedings of IEEE INFOCOM, 2002.
5. D. Dubhashi, C. Johansson, O. Haggstrom, A. Panconesi, and M. Sozio. Irrigating ad hoc networks in constant time. In Proceedings of ACM SPAA, 2005.
6. E.N.Gilbert. Random plane networks. Journal of the Society for Industrial and Applied Mathematics, 9(4):533-543, 1961.
7. M. Franceschetti, J. Bruck, M. Cook, and R. Meester. Continuum percolation with unreliable and spread out connections. Journal of Statistical Physics, 2004.
8. P. Gupta and P. Kumar. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, 1998.
9. P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388-404, March 2000.
10. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the Send ACM Symposium on Theory of Computing, 2000.
11. B. Krishnamachari, S. Wicker, and R. Bejar. Phase transition phenomena in wireless ad-hoc networks. In Proceedings of the Symposium on Ad-Hoc Wireless Networks (GlobeCom), 2001.
12. E. Lebhar and N. Schabanel. Almost optimal decentralized routing in long-range contact networks. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming, pages 179-188, 2004.
13. T. Leighton. Introduction to parallel algorithms and architectures. Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, California, 1992.
14. L. Li, J. Halpern, and Z. Haas. Gossip-based ad hoc routing. In Proceedings of IEEE INFOCOM, 2002.
15. X.-Y. Li, K. Moaveninejad, and O. Frieder. Regional gossip routing for wireless ad hoc networks. MONET, 1(1):61-77, 2005.
16. C. Martel and V. Nguyen. Analyzing kleinberg's (and other) small-world models. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, 2004.
17. P. Maymounkov and D. Mazieres. Kademlia: A peer-to-peer information system based on the xor metric. In Proceedings of IPTPSOS, March 2002.
18. R. Meezer and R. Roy. Continuum Percolation. Cambridge University Press, 1996.
19. W. J. Ouchark, J. A. Davis, S. Lakshmivarahan, and S. K. Dhall. Experiences with the intel hypercube. In Proceedings of the 1986 SIGAPP Symposium on Applied Computing, pages 2-7, 1986.
20. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of the ACM SIGCOMM Conference, 2001.
21. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218:329-339, 2001.
22. Y. Sasson, D. Cavin, and A. Schiper. Probabilistic broadcast for flooding in wireless mobile ad hoc networks. In Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), 2003.
23. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM Conference, 2001.
24. D. Watts and S. Strogatz. Collective dynamics of small world networks. Nature, pages 393-440, 1998.
25. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1), January 2004.