2009 · 16 citations · 7 references
ComputingComputer ScienceAlgorithmsComputer NetworksMobile ComputingAd Hoc Mobile NetworksMobile Ad Hoc NetworksMobile NetworkingMobile NetworksRoutingRouting AlgorithmsAd Hoc NetworksAnt Colony OptimizationCongestion-aware RoutingEnd-to-end DelayMobile Ad Hoc Network RoutingNode MobilityRoute DiscoveryRouting In Mobile Networks
Abstract—The paper presents a novel proactive algorithm to routing called Probabilistic Ant Routing, in mobile ad hoc networks, which is inspired by Ant Colony Optimization (ACO) framework and uses “ants” for route discovery, maintenance and improvement. The algorithm is based on a modification of the state transition rule of ACO routing algorithm that results in maintaining higher degree of exploration along with congestion awareness in the search space. This leads to reduced end-to-end delay and also lowers the overhead at high node density. The comparative experimental results of the proposed algorithm with the state-of-the-art AODV reactive routing algorithm of the MANET are provided keeping mobility and density of nodes as the main consideration. The proposed algorithm is tested for different network sizes and node mobility. The experimental results are very promising as the proposed algorithm exhibits superior performance with respect to reactive AODV routing algorithm in terms of end-to-end delay.
7
A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks
John S. Baras, Harsh Mehta · 2003 · 188 citations · Full text