A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks

John S. Baras (1) , Harsh Mehta (1)

1 ECE - University of Maryland - Department of Electrical and Computer Engineering [Univ. of Maryland]

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.

Domaines: Informatique mobile; Réseaux et télécommunications [cs.NI]; Performance et fiabilité [cs.PF]

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⟩