Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Algorithm Engineering

WAE 1999: Algorithm Engineering pp 95–109Cite as

Counting in Mobile Networks: Theory and Experimentation

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1668))

Abstract

In this work we study the problem of counting the number of mobile hosts in mobile networks. Mobile networks aim to provide continuous network connectivity to users regardless of their location. Host mobility introduces a number of new features and requirements for the distributed algorithms. In this case, the use of conventional distributed algorithms from mobile hosts results in a number of serious drawbacks. The two tier principle has been proposed (see [2]) to overcome these problems. The use of this principle for structuring distributed algorithms for mobile hosts means that the computation and communications requirements of an algorithm is borne by the static hosts to the maximum extend possible.

The Distributed Systems Platform (DSP) is a software platform that has been designed for the implementation, simulation and testing of distributed protocols. It offers a set of subtools which permit the researcher and the protocol designer to work under a familiar graphical and algorithmic environment. The use of DSP gave us considerable input and permitted us to experimentally test the two tier principle for the counting problem of mobile hosts. Moreover it helped us to design new distributed algorithms for this problem, improve them and experimentally test them, validating their performance under various conditions.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. “Impact of mobility on Distributed Computations”, A. Acharya, B. R. Badrinath, T. Imielinski, Operating Systems Review, April 1993.

    Google Scholar 

  2. “Structuring distributed algorithms for Mobile Hosts”,, A. Acharya, B. R. Badrinath, T. Imielinski, 14th International Conference on Distributed Computing systems, June 1994.

    Google Scholar 

  3. “Concurrent online tracking of mobile users”,, B. Awerbuch, D. Peleg.

    Google Scholar 

  4. “IP-based protocols for mobile internetworking”,, D. Duchamp, G. Q. Maquire, J. Ioannidis, In Proc. of ACM SIGCOM, September 1991.

    Google Scholar 

  5. “Brief Announcement: Fundamental Distributed Protocols in Mobile Networks”,, K. Hatzis, G. Pentaris, P. Spirakis, V. Tampakas, R. Tan, Eighteenth ACMSymposium on Principles of Distributed Computing (PODC’ 99), Atlanta, GA, USA.

    Google Scholar 

  6. “Fundamental Control Algorithms in Mobile Networks”,, K. Hatzis, G. Pentaris, P. Spirakis, V. Tampakas, R. Tan, Eleventh ACM Symposium on Parallel Algorithms and Architectures (SPAA 99), June 27-30 1999, Saint-Malo, France.

    Google Scholar 

  7. “The description of a distributed algorithm under the DSP tool: The BNF notation”,, ALCOM-IT Technical Report, 1996.

    Google Scholar 

  8. “The design of the DSP tool”, ALCOM-IT Technical Report, 1996.

    Google Scholar 

  9. “DSP: Programming manual”, 1998.

    Google Scholar 

  10. ”The specifications of the DSP tool, ALCOM-IT Technical Report, 1996.

    Google Scholar 

  11. “Mobile Computing”, T. Imielinski, H. F. Korth, Kluwer Academic Publishers, 1996.

    Google Scholar 

  12. “Distributed Systems towards a formal approach”, G. Le Lann, IFIP Congress, 1977.

    Google Scholar 

  13. Nancy Lynch, “Distributed algorithms”, Morgan Kaufmann Publishers, 1996.

    Google Scholar 

  14. Gerard Tel, “Introduction to distributed algorithms”, Cambridge University Press, 1994.

    Google Scholar 

  15. “Distributed Dynamic Channel Allocation for Mobile Computing”, R. Prakash, N. Shivaratri, M. Sighal, In Proc. of ACM PODC 1995.

    Google Scholar 

  16. “Competitive Call Control in Mobile Networks”, G. Pantziou, G. Pentaris, P. Spirakis, 8th International Symposium on Algorithms and Computation, ISAAC 97, December 1997.

    Google Scholar 

  17. “Symmetry Breaking in Distributive Networks”, A. Itai and M. Rodeh, In proceedings of 22nd FOCS, 1981, pp 150–158.

    Google Scholar 

  18. “Approximating the Size of a Dynamically Growing Asynchronous Distributed Network”, B. Awerbuch and S A. Plotkin, Technical Report MIT/LCS/TM-328, April 1987.

    Google Scholar 

  19. “Implementation and testing of eavesdropper protocols using the DSP tool”, K. Hatzis, G. Pentaris, P. Spirakis and V. Tampakas, In Workshop on Algotithmic Engineering WAE 98, Saarbruecken, Aug. 1998. Postcript version in http://helios.cti.gr/alcom-it/foundation

  20. “Agent-Mediated Message Passing for constraint Environment”, A. Athas and D. Duchamp, In USENIX Symposium on Mobile and Location Independent Computing, Aug. 1993.

    Google Scholar 

  21. “Unix for Nomads: Making Unix support mobile computing”, M. Bender et al., In USENIX Symposium on Mobile and Location Independent Computing, Aug. 1993.

    Google Scholar 

  22. “Power efficient filtering on data on the air”, T. Imielinski et al., In EDBT’94, 1994.

    Google Scholar 

  23. “ System Issues in Mobile Computing” B. Marsh, F. Douglis, and R. Caceres, T.R. MITL-TR-50-93, MITL, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Technology Institute Kolokotroni 3, 26221, Patras, Greece

    K. Hatzis, G. Pentaris, P. Spirakis & B. Tampakas

  2. Computer Engineering and Informatics Department, Patras University, 26500, Rion, Patras, Greece

    K. Hatzis, G. Pentaris & P. Spirakis

  3. Technological Educational Institute (TEI) of Patras, M Alexandrou 1, 26334, Koukouli, Patras, Greece

    B. Tampakas

Authors
  1. K. Hatzis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Pentaris
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Spirakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. B. Tampakas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Duke University, Box 90129, Durham, NC, 27708-0129, USA

    Jeffrey S. Vitter

  2. Department of Computer Science, University of London, King’s College, Strand, London, WC2R 2LS, UK

    Christos D. Zaroliagis

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hatzis, K., Pentaris, G., Spirakis, P., Tampakas, B. (1999). Counting in Mobile Networks: Theory and Experimentation. In: Vitter, J.S., Zaroliagis, C.D. (eds) Algorithm Engineering. WAE 1999. Lecture Notes in Computer Science, vol 1668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48318-7_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-48318-7_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66427-7

  • Online ISBN: 978-3-540-48318-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation