Routing Algorithms for Mobile Multi-Hop Ad-Hoc Networks

Mesut Güneş, Otto Spaniol

Proceedings of Next Generation Network Technologies International Workshop, (Hristo Turlakov, Luben Boyanov Ed.), Routing, The Central Laboratory for Parallel Processing, Department ''Distributed Computing Systems and Networks'', pp. 10-24 October, O

2002-10

eng

Text

@inproceedings{Guenes+:2002e, author = {Mesut G{\"u}nes and Otto Spaniol}, title = {{Routing Algorithms for Mobile Multi-Hop Ad-Hoc Networks}}, booktitle = {Proceedings of Next Generation Network Technologies International Workshop}, year = {2002}, editor = {Hristo Turlakov and Luben Boyanov}, pages = {10-24 October}, address = {Rousse, Bulgaria}, month = {October}, organization = {The Central Laboratory for Parallel Processing, Department ''Distributed Computing Systems and Networks''}, abstract = {A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These networks have an important advantage, they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. This exibility, however, comes at a price: communication is dif cult to organize due to frequent topology changes. In this paper we present a new on-demand routing algorithm for mobile, multi-hop ad-hoc networks. The algorithm is based on ant algorithms which are a class of swarm intelligence. Ant algorithms try to map the solution capability of ant colonies to mathematical and engineering problems. The Ant-Colony-Based Routing Algorithm (ARA) is highly adaptive, ef cient and scalable. The main goal in the design of the algorithm was to reduce the overhead for routing. Furthermore, we compare the performance of ARA with other routing protocols, including DSDV, AODV, and DSR through simulation results.}, owner = {guenes}, timestamp = {2007.08.23}, type = {Routing} }