An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks

  • Ioannis Chatzigiannakis
  • Sotiris Nikoletseas
  • Nearchos Paspallis
  • Paul Spirakis
  • Christos Zaroliagis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2141)

Abstract

We investigate basic communication protocols in ad-hoc mobile networks. We follow the semi-compulsory approach according to which a small part of the mobile users, the support ∑, that moves in a predetermined way is used as an intermediate pool for receiving and delivering messages. Under this approach, we present a new semi-compulsory protocol called the runners in which the members of ∑ perform concurrent and continuous random walks and exchange any information given to them by senders when they meet. We also conduct a comparative experimental study of the runners protocol with another existing semi-compulsory protocol, called the snake, in which the members of ∑ move in a coordinated way and always remain pairwise adjacent. The experimental evaluation has been carried out in a new generic framework that we developed to implement protocols for mobile computing. Our experiments showed that for both protocols only a small support is required for efficient communication, and that the runners protocol outperforms the snake protocol in almost all types of inputs we considered.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Adler and C. Scheideler. Efficient Communication Strategies for Ad-Hoc Wireless Networks. In Proc. 10th Annual Symposium on Parallel Algorithms and Architectures-SPAA’98, 1998.Google Scholar
  2. 2.
    I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. Analysis and Experimental Evaluation of an Innovative and Efficient Routing Approach for Ad-hoc Mobile Networks. In Proc. 4th Annual Workshop on Algorithmic Engineering- WAE’00, 2000.Google Scholar
  3. 3.
    I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. An Efficient Routing Protocol for Hierarchical Ad-Hoc Mobile Networks. In Proc. 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, satellite workshop of IPDPS’01, 2001.Google Scholar
  4. 4.
    I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. Self-Organizing Ad-hoc Mobile Networks: The problem of end-to-end communication. To appear as a short paper In Proc. 20th Annual Symposium on Principles of Distributed Computing- PODC’01, 2001.Google Scholar
  5. 5.
    Z. J. Haas and M. R. Pearlman. The performance of a new routing protocol for the reconfigurable wireless networks. In Proc. ICC’98, 1998.Google Scholar
  6. 6.
    K. P. Hatzis, G. P. Pentaris, P. G. Spirakis, V. T. Tampakas and R. B. Tan. Fundamental Control Algorithms in Mobile Networks. In Proc. 11th Annual Symposium on Parallel Algorithms and Architectures-SPAA’99, 1999.Google Scholar
  7. 7.
    G. Holland and N. Vaidya. Analysis of TCP Performance over Mobile Ad Hoc Networks. In Proc. 5th Annual ACM/IEEE International Conference on Mobile Computing- MOBICOM’99, 1999.Google Scholar
  8. 8.
    T. Imielinski and H. F. Korth. Mobile Computing. Kluwer Academic Publishers, 1996.Google Scholar
  9. 9.
    R. Iyer, D. Karger, H. Rahul, and M. Thorup. An experimental study of polylogarithmic fully-dynamic connectivity algorithms. In Proc. 2nd Workshop on Algorithm Engineering and Experiments- ALENEX 2000, pp. 59–78.Google Scholar
  10. 10.
    Q. Li and D. Rus. Sending Messages to Mobile Users in Disconnected Ad-hoc Wireless Networks. In Proc. 6th Annual ACM/IEEE International Conference on Mobile Computing- MOBICOM’00, 2000.Google Scholar
  11. 11.
    K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.Google Scholar
  12. 12.
    N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., 1996.Google Scholar
  13. 13.
    V. D. Park and M. S. Corson. Temporally-ordered routing algorithms (TORA): version 1 functional specification. IETF, Internet Draft, draft-ietf-manet-tora-spec-02.txt, Oct. 1999.Google Scholar
  14. 14.
    C. E. Perkins and E. M. Royer. Ad-hoc On demand Distance Vector (AODV) routing. IETF, Internet Draft, draft-ietf-manet-aodv-04.txt, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Ioannis Chatzigiannakis
    • 1
    • 2
  • Sotiris Nikoletseas
    • 1
    • 2
  • Nearchos Paspallis
    • 2
  • Paul Spirakis
    • 1
    • 2
  • Christos Zaroliagis
    • 1
    • 2
  1. 1.Computer Technology InstitutePatrasGreece
  2. 2.Department of Computer Engineering and InformaticsUniversity of PatrasPatrasGreece

Personalised recommendations