A Probabilistic Emergent Routing Algorithm (PERA) for Mobile Ad Hoc Networks

J.S. Baras and H. Mehta

WiOpt ’03: Modeling and Optimization in Mobile, AdHoc and Wireless Networks, Sophia-Antipolis, France, March 3-5, 2003

 

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.