An experimental study of basic communication protocols in ad-hoc mobile networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2141 LNCS, Issue , 2001, Pages 159-171

  Chatzigiannakis, Ioannis ^a,b   Nikoletseas, Sotiris ^a,b   Paspallis, Nearchos ^b   Spirakis, Paul ^a,b   Zaroliagis, Christos ^a,b  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

AD-HOC MOBILE NETWORKS; COMMUNICATION PROTOCOLS; CONTINUOUS RANDOM WALK; EXPERIMENTAL EVALUATION; EXPERIMENTAL STUDIES; GENERIC FRAMEWORKS; MOBILE USERS; RUNNERS PROTOCOLS; SNAKE PROTOCOLS; AD HOC MOBILE NETWORKS; EFFICIENT COMMUNICATIONS;

AD HOC NETWORKS; ALGORITHMS; COMMUNICATION; GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS; LAKES; OPERATIONS RESEARCH; MOBILE TELECOMMUNICATION SYSTEMS; WIRELESS NETWORKS;

NETWORK PROTOCOLS; MOBILE AD HOC NETWORKS;

EID: 78650722100     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44688-5_13     Document Type: Conference Paper

References (14)

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.
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.
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.
4. I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. Self-Organizing Ad-hoc Mobile Networks: The problem ofe nd-to-end communication. To appear as a short paper In Proc. 20th Annual Symposium on Principles of Distributed Computing - PODC'01, 2001.
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.
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.
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.
8. T. Imielinski and H. F. Korth. Mobile Computing. Kluwer Academic Publishers, 1996.
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.
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.
11. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999.
12. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., 1996.
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.
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.