Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/inria-00466600
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, March 24, 2010 - 11:53:08 AM
Last modification on : Wednesday, March 24, 2010 - 1:02:10 PM
Long-term archiving on: : Friday, June 25, 2010 - 12:15:22 PM

File

mehta-probabilistic.pdf
Files produced by the author(s)

Identifiers

  • 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. ⟨inria-00466600⟩

Share

Metrics

Record views

567

Files downloads

522