Scalable analysis and design of ad hoc networks via random graph theory

Proceedings of the Discrete Algorithms and Methods for Mobile Computing and Communications

Volumn , Issue , 2002, Pages 43-50

  Faragó, András ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

Ad hoc network; Random graph model; Random network topology

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SCIENCE; GRAPH THEORY; OPTIMIZATION; PROBABILITY;

SCALABLE DESIGN;

COMPUTER NETWORKS;

EID: 0036987474     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/570811.570816     Document Type: Conference Paper

References (17)

1. d", Adv. Appl. Prob., 29(1997), pp. 567-581.
2. S. Basagni, I. Chlamtac, A. Faragó, V.R. Syrotiuk and R. Talebi, "Route Selection in Mobile Multimedia Ad Hoc Networks", Sixth IEEE International Workshop on Mobile Multimedia Communications (MOMUC'99), San Diego, CA, Nov. 15-17, 1999.
3. C. Bettstetter, "On the Minimum Node Degree and Connectivity of a Wireless Multihop Network", MOBIHOC'02, Lausanne, Switzerland, June 9-11, 2002, pp. 80-91.
4. B. Bollobás, Random Graphs, Academic Press, London, UK, 1985.
5. W. Aiello, F. Chung and L. Lu, "A Random Graph Model for Massive Graphs", 32nd ACM Symp. on Theory of Computing (STOC'2000).
6. A. Faragó, "Almost Surely Almost Exact Optimization in Random Graphs", Technical Report, Dept. of Comp. Sci.: The University of Texas at Dallas, Oct 2000.
7. A. Frieze and C. McDiarmid, "Algorithmic Theory of Random Graphs", Random Structures and Algorithms, 10(1997), pp. 5-42.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
9. 1-ε", in Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Burlington, VT, 14-16 October 1996, pp. 627-636.
10. P. Jacquet and A. Laouiti, "Analysis of Mobile Ad Hoc Network Routing Protocols in Random Graph Models", MOBICOM'2000 (See also INRIA Research Report #3835).
11. S. Janson, T. Luczak and A. Rucinski, Random Graphs, Wiley-Interscience, 2000.
12. J. Kleinberg, "Authoritative Sources in a Hyperlinked Environment" 9th ACM-SIAM Symposium on Discrete Algorithms (SODA'98), 1998.
13. J. Kleinberg "The Small-World Phenomenon: An Algorithmic Perspective", Cornell Computer Science Technical Report 99-1776, October 1999.
14. A.B. McDonald and T. Znati, "A Path Availability Model for Wireless Ad-Hoc Networks", IEEE Wrireless Communications and Networking Conference (WCNC'99), New Orleans, LA, Sep. 21-24, 1999.
15. M.D. Penrose, "On k-connectivity for a Geometric Random Graph", Random Structures and Algorithms, 15(1999/2), pp. 145-164.
16. T.K. Philips, S.S. Panwar and A.N. Tantawi, "Connectivity Properties of a Packet Radio Model", IEEE Trans. Inf. Theory, 35(1989), pp. 1044-1046.
17. E.W. Zegura, K.L. Clavert and M.J. Donahoo, "A Quantitative Comparison of Graph-Based Models for Internet Topology", IEEE/ACM Trans. Networking, 5(1997), pp. 770-783.