A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks
Date: March 03 - March 05, 2003
Mobile ad hoc networks are infrastructureless 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. The Swarm Intelligence paradigm has recently been used in solving the routing problem in static computer networks with encouraging results. These
algorithms have been proven to be robust and resilient to topology changes. In this paper we present preliminary
performance results obtained for this class of algorithms when applied to MANETs. 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.