Approximating the connectivity between nodes when simulating large-scale mobile ad hoc radio networks

Journal of Systems and Software

Volumn 73, Issue 1 SPEC. ISS., 2004, Pages 63-74

  Barrett, Christopher L ^a   Marathe, Madhav V ^a   Engelhart, D Charles ^b   Sivasubramaniam, Anand ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONSTRAINT THEORY; GRAPH THEORY; TELECOMMUNICATION NETWORKS;

GRAPH CONNECTIVITY; MOBILE AD HOC RADIO NETWORKS; NETWORK DESIGN; SHORTEST PATH DISTRIBUTION;

MOBILE RADIO SYSTEMS;

EID: 3042820191     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(03)00245-0     Document Type: Conference Paper

References (20)

1. Bajaj, L., Takai, M., Ahuja, R., Tang, K., Bagrodia, R., Gerla, M., 1999. GloMoSim: A scalable network simulation environment. UCLA Computer Science Department Technical Report 990027.
2. Barabási A.L., Albert R. Emergence of scaling in random networks. Science. 286:1999;509-512.
3. Barabási A.L., Albert R., Jeong H. Mean field theory for scale-free random networks. Physica A. 272:1999;173.
4. Barabási, A.L., Ravasz, E., 2002. Hierarchical organization in complex networks.
5. Barrett, C.L., Engelhart, D.C., Marathe, M.V., Sivasubramamam, A., 2003. Approximate connectivity graph generation in mobile ad hoc radio networks. In: Proceedings of the 36th Annual Simulation Symposium, pp. 81-88.
6. Basch, J., Guibas, L.J., Zhang, L., 1997. Proximity problems on moving points. In: Proceedings of 13th ACM Symposium of Computational Geometry.
7. Bollobás B. Random Graphs. 1985;Academic Press, London, New York.
8. Chung, F.R.K., Erdös, P., Graham, R.L., Ulam, S.M., Yao, F.F., 1979. Minimal decomposition of two graphs into pairwise isomorphic subgraphs. In: Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory, and Computing.
9. Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F., 2001. Los Alamos Archive cond-mat/0112143.
10. Erdos P., Rényi A. On random graphs-i. Publ. Math. Debrecen. 6:1959;290.
11. Faloutsos, C., Faloutsos, M., Faloutsos, P., 1999. On power-law relationships of the internet topology. SIGCOMM, pp. 251-262.
12. Forgey E. Cluster analysis of multivariate data: efficiency vs. interpretability of classification. Biometrics. 21:1965;768.
13. Information Sciences Institute, 2000. The Network Simulator - ns-2, version 2.1b8a. Available from: 〈www.isi.edu/nsnam/ns〉
14. Johnson D.B., Maltz D.A. Dynamic source routing in ad hoc wireless networks. Imielinski T., Korth H. Mobile Computing. 1996;Kluwer Academic Publishers.
15. Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C., Silverman, R., Wu, A.Y., 2000. The analysis of a simple k -means clustering algorithm. In: Symposium on Computational Geometry.
16. Lloyd S.P. Least squares quantization m PCM. IEEE Trans. Inform. Theory. 1982;129-137.
17. Matousek, J., 1999. On approximate geometric k -clustering, Prague, Czech Republic. Manuscript, Department of Applied Mathematics, Charles University.
18. Santivánẽz, C., McDonnald, B., Stavrakakis, I., Ramanathan, R., 2002. On the scalability of ad hoc routing protocols. In: Proceedings of IEEE INFOCOM'02.
19. Watts D.J., Strogatz S.H. Collective dynamics of 'small-world' networks. Nature. 393:1998;440.
20. Yao F.F. Graph 2-isomorphism is NP-complete. Inform. Process. Lett. 9:1979;68-72.