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. The Ant-Colony-Based Routing Algorithm (ARA) is highly adaptive, efficient and scalable. It 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. In this paper we present some extensions to the basic idea and show through simulation results the performance gain and compare it with AODV and DSR.
Titel
Ant-Routing-Algorithm for mobile multi-hop ad-hoc networks
Proceedings of IFIP and IEEE Conference on Network Control and Engineering for QoS Security and Mobility II (Net-Con 2003), (Dominique Gaiti, Guy Pujolle, Ahmed Al-Naamany, Hadj Bourdoucen, Lazhar Khriji Ed.), IFIP, pp. 120-138, Muscat, Oman: Kluwer
Datum
2003-10
Sprache
eng
Art
Text
BibTeX Code
@inproceedings{Guenes+:2003d,
author = {Mesut G{\"u}nes and Otto Spaniol},
title = {Ant-Routing-Algorithm for mobile multi-hop ad-hoc networks},
booktitle = {Proceedings of IFIP and IEEE Conference on Network Control and Engineering for QoS, Security, and Mobility II (Net-Con 2003)},
year = {2003},
editor = {Dominique Gaiti and Guy Pujolle and Ahmed Al-Naamany and Hadj Bourdoucen and Lazhar Khriji},
pages = {120-138},
address = {Muscat, Oman},
month = {13-15 October},
organization = {IFIP},
publisher = {Kluwer Academic Publishers},
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. The Ant-Colony-Based Routing Algorithm (ARA) is highly adaptive, efficient and scalable. It 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. In this paper we present some extensions to the basic idea and show through simulation results the performance gain and compare it with AODV and DSR.},
owner = {guenes},
timestamp = {2007.08.23}
}
