Abstract
An ad-hoc mobile network is a collection of mobile hosts, with wireless communication capability, forming a temporary network without the aid of any established fixed infrastructure. In such a (dynamically changing) network it is not at all easy to avoid broadcasting (and flooding).
In this paper we propose, theoretically analyse and experimentally validate a new and efficient protocol for pairwise communication. The protocol exploits the co-ordinated motion of a small part of the network (i.e. it is a semi-compulsory protocol) in order to provide to various senders and receivers an efficient support for message passing. Our implementation platform is the LEDA system and we have tested the protocol for three classes of graphs (grids, random graphs and bipartite multi-stage graphs) each abstracting a different “motion topology”.
Our theoretical analysis (based on properties of random walks) and our experimental measurements indicate that only a small fraction of the mobile stations are enough to be exploited by the support in order to achieve very fast communication between any pair of mobile stations.
This work was partially supported by the EU projects IST FET-OPEN ALCOM-FT, IMPROVING RTN ARACNE and the Greek GSRT Project PENED99-ALKAD.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Aldous and J. Fill: Reversible Markov Chains and Random Walks on Graphs. Unpublished manuscript. http://stat-www.berkeley.edu/users/aldous/book.html (1999).
C. E. Perkins and E. M. Royer: Ad hoc on demand distance vector (AODV) routing. IETF, Internet Draft, draft-ietf-manet-aodv-04.txt (IETF’99). (1999).
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).
J. Broch, D. B. Johnson, and D. A. Maltz: The dynamic source routing protocol for mobile ad hoc networks. IETF, Internet Draft, draft-ietf-manet-dsr-01.txt, Dec. 1998. (1998).
B. Das, R. Sivakumar and V. Bharghavan: Routing in ad hoc networks using a virtual backbone. In Proc. IEEE (IC3N’97) (1997).
Z. J. Haas and M. R. Pearlman: The performance of a new routing protocol for the reconfigurable wireless networks. In Proc. ICC’ 98. (1998).
Z. J. Haas and M. R. Pearlman: The zone routing protocol (ZRP) for ad hoc networks. IETF, Internet Draft, draft-zone-routing-protocol-02.txt, June 1999. (1999).
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).
T. Imielinski and H. F. Korth: Mobile Computing. Kluwer Academic Publishers. (1996).
P. Johansson, T. Larsson, N. Hedman, B. Mielczarek and M. Degermark: Scenariobased Performance Analysis of Routing Protocols for Mobile Ad-Hoc Networks. In Proc. Mobile Computing (MOBICOM’99) (1999).
Y. Ko and N. H. Vaidya: Location-Aided Routing (LAR) in Mobile Ad Hoc Networks. In Proc. Mobile Computing (MOBICOM’98). (1998).
K. Mehlhorn and S. Naher: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press. (1999).
V. D. Park and M. S. Corson: Temporally-ordered routing algorithms (TORA) version 1 functional specification. IETF, Internet Draft, draft-ietf-manet-toraspec-02.txt, Oct. 1999. (1999).
G. Aggelou and R. Tafazolli.: RDMAR: A Bandwidth-efficient Routing Protocol for Mobile Ad Hoc Networks. In Proc. 2nd ACM International Worksh. on Wireless Mobile Multimedia (WoWMom’99) (1999).
R. Motwani and P. Raghavan: Randomized Algorithms. Cambridge University Press. (1995).
E. M. Royer and C. K. Toh: A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks. (1999).
I. Chatzigiannakis, S. Nikoletseas and P. Spirakis: Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Adhoc Mobile Networks (full paper). CTI Technical Report. Aug. 2000. http://helios.cti.gr/adhoc/routing.html (2000).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chatzigiannakis, I., Nikoletseas, S., Spirakis, P. (2001). Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks. In: Näher, S., Wagner, D. (eds) Algorithm Engineering. WAE 2000. Lecture Notes in Computer Science, vol 1982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44691-5_9
Download citation
DOI: https://doi.org/10.1007/3-540-44691-5_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42512-0
Online ISBN: 978-3-540-44691-0
eBook Packages: Springer Book Archive