Advertisement

Empirical Analysis of the Connectivity Threshold of Mobile Agents on the Grid

  • Xavier Pérez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3503)

Abstract

This paper gives empirical evidence about the connectivity properties of moving agents on a grid graph. The theoretical aspects of the problem were studied asymptotically in [1]. Here, it is proven that the asymptotical behaviour is also true for real size cases.

Keywords

Mobile Agent Bounded Time Interval Giant Component Simple Component Grid Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Díaz, J., Pérez, X., Serna, M., Wormald, N.C.: The walkers problem on the cycle and the grid. In: Proc. of 22nd Annual Symposium on Theoretical Aspects of Computer Science, pp. 353–364 (2005)Google Scholar
  2. 2.
    Jardosh, A., Belding-Royer, E., Almeroth, K., Suri, S.: Towards Realisitic Mobility Models for Mobile Ad hoc Networks. In: ACM Mobicom, San Diego (2003)Google Scholar
  3. 3.
    Jennings, E., Okino, C.: On the diameter of sensor networks. In: Preceedings of the IEEE Aerospace Conference, Montana (2002)Google Scholar
  4. 4.
    Meguerdichian, S., Coushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: Proc. of INFOCOM, pp. 1380–1387 (2001)Google Scholar
  5. 5.
    Royer, E.M., Melliar-Smith, P.M., Moser, L.E.: An anlysis of the optimum node density for ad hoc mobile networks. In: Proc. of IEEE International Conference on Communications, pp. 857–861 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Xavier Pérez
    • 1
  1. 1.Dept. Llenguatges i SistemesUniversitat Politècnica de Catalunya 

Personalised recommendations