Abstract
We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed environment modelled by a motion graph, and are able to communicate if they are at distance at most d. As the agents move randomly, we analyse the evolution in time of the connectivity between a set of w agents, asymptotically for a large number N of nodes, when w also grows large, and for different values of d. The particular topologies of the environment we study in this paper are the cycle and the toroidal grid.
The work of the first three authors was partially supported by the EU under contract 001907 (DELIS). The fourth author was supported by the Canada Research Chairs program. The first author was partially supported by the Distinció per a la Recerca de la GC, 2002.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agarwal, P.K., Guibas, L., Edelsbrunner, H., Erickson, J., Isard, M., Har-Peled, S., Hershberger, J., Jensen, C., Kavraki, L., Koehl, P., Lin, M., Manocha, D., Metaxas, D., Mirtich, B., Mount, D.: Algorithmic issues in modeling motion. ACM Computing Surveys 34, 550–572 (2002)
Barbour, A.D., Holst, L., Janson, S.: Poisson Approximation. Clarendon, Oxford (1992)
Bollobás, B.: Random Graphs, 2nd edn. Academic Press, London (2002)
Gao, Z., Wormald, N.C.: Asymptotic normality determined by high moments, and submap counts of random maps. In: Probability Theory and Related Fields (to appear)
Guibas, L., Hershberger, J., Suri, S., Zhang, L.: Kinetic Connectivity for Unit Disks. Discrete and Computational Geometry 25, 591–610 (2001)
Kramer, K.H., Minar, N., Maes, P.: Tutorial: Mobile Software Agents for Dynamic Routing. Mobile Computing and Communications Review 3, 12–16 (1999)
Penrose, M.: On k-connectivity for random geometric graphs. Random Structures and Algorithms 15, 145–164 (1999)
Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Santi, P., Blough, D.M.: An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks. In: Proceedings of IEEE Conference on Dependable Systems and Networks, Washington DC, June 2002, pp. 89–98 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Díaz, J., Pérez, X., Serna, M.J., Wormald, N.C. (2005). Connectivity for Wireless Agents Moving on a Cycle or Grid. In: Diekert, V., Durand, B. (eds) STACS 2005. STACS 2005. Lecture Notes in Computer Science, vol 3404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31856-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-31856-9_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24998-6
Online ISBN: 978-3-540-31856-9
eBook Packages: Computer ScienceComputer Science (R0)