A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks

Abstract : Mobile ad hoc networks are infrastructure-less networks consisting of wireless, possibly mobile nodes which are organized in peer-to-peer and autonomous fashion. The highly dynamic topology, limited bandwidth availability and energy constraints make the routing problem a challenging one. In this paper we take a novel approach to the routing problem in MANETs by using swarm inteligenceinspired algorithms. The proposed algorithm uses Ant-like agents to discover and maintain paths in a MANET with dynamic topology. We present simulation results that measure the performance of our algorithm with respect to the characteristics of a MANET, the varying parameters of the algorithm itself as well as performance comparison with other well-known routing protocols.
Type de document :
Communication dans un congrès
WiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar 2003, Sophia Antipolis, France. 10 p., 2003
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00466600
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 24 mars 2010 - 11:53:08
Dernière modification le : mercredi 24 mars 2010 - 13:02:10
Document(s) archivé(s) le : vendredi 25 juin 2010 - 12:15:22

Fichier

mehta-probabilistic.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00466600, version 1

Collections

Citation

John S. Baras, Harsh Mehta. A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks. WiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar 2003, Sophia Antipolis, France. 10 p., 2003. 〈inria-00466600〉

Partager

Métriques

Consultations de la notice

535

Téléchargements de fichiers

523