Walkers on the cycle and the grid

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 2, 2008, Pages 747-775

  Diaz, J ^a   Perez, X ^a   Serna, M J ^a   Wormald, N C ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Ad hoc network; Connectivity; Distance graph; Mobile agents

Indexed keywords

CONNECTIVITY; DISTANCE GRAPH; MOTION GRAPH; TOROIDAL GRIDS;

AD HOC NETWORKS; GRAPH THEORY; WIRELESS TELECOMMUNICATION SYSTEMS;

MOBILE AGENTS;

EID: 65349192429     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/060659855     Document Type: Article

References (15)

1. P. K. AGARWAL, L. GUIBAS, H. EDELSBRUNNER, J. ERICKSON, M. ISARD, S. HAR-PELED, J. HERSHBERGER, C. JENSEN, L. KAVRAKI, P. KOEHL, M. LIN, D. MANOCHA, D. METAXAS, B. MIRTICH, AND D. MOUNT, Algorithmic issues in modeling motion, ACM Computing Surveys, 34 (2002), pp. 550-572.
2. B. BOLLOBÁs, Random Graphs, 2nd ed., Academic Press, London, 2002.
3. J. DÍAZ, X. PEREZ, M. SERNA, AND N. C. WORMALD, Connectivity for wireless agents moving on a cycle or grid, in Proceedings of STACS 2005, Lecture Notes in Corn-put. Sci. 3404, Springer-Verlag, Berlin, 2005, pp. 353-364.
4. J. DÍAZ, X. PEREZ, M. SERNA, AND N. C. WORMALD, Walkers on the Cycle and the Grid, Research Report CORR 2006-09, Faculty of Mathematics, University of Waterloo, Waterloo, Canada, 2006.
5. L. GUIBAS, J. HERSHBERGER, S. SURI, AND LI ZHANG, Kinetic Connectivity for Unit Disks, Discrete Comput. Geom., 25 (2001), pp. 591-610.
6. R. HEKMAT, Ad-hoc Networks: Fundamental Properties and Network Topologies, Springer-Verlag, New York, 2006.
7. L. HOLST, On multiple covering of a circle with random, arcs, J. Appl. Probab., 16 (1980), pp. 284-290.
8. S. JANSON, T. LUCZAK, AND A. RUCIŃSKI, Random Graphs, Wiley, New York, 2000.
9. A. JARDOSH, E. BELDING-ROYER, K. ALMEROTH, AND S. SURI, Towards realisitic mobility models for mobile ad-hoc networks, in Proceedings of ACM Mobicom, San Diego, CA, 2003, pp. 217-229.
10. M. D. PENROSE, The longest edge of the random minimal spanning tree, Ann. Appl. Probab., 7 (1997), pp. 340-361.
11. M. D. PENROSE, On k-connectivity for a geometric random graph, Random Structures Algorithms, 15 (1999), pp. 145-164.
12. X. PÉREZ, Aspects of Random Graphs, Doctoral Dissertation, Universitat Politècn¡ca de Catalunya, Barcelona, Spain, 2007.
13. E. M. ROYER, P. M. MELLIAR-SMITH, AND L. E. MOSER, An analysis of the optimum node density for ad hoc mobile networks, in Proceedings of the IEEE International Conference on Communications, IEEE Communications Society, Piscataway, NJ, 2001, pp. 857-861.
14. N. C. WORMALD, Random graphs and asymptotics, in Handbook of Graph Theory, J. L. Gross and J. Yellen, eds., CRC, Boca Raton, PL, 2004, pp. 817-836.
15. F. XUE AND P. R. KUMAR, Scaling Laws for Ad Hoc Wireless Networks: An Informa- tion Theoretic Approach, NOW Publishers, Delft, The Netherlands, 2006.