A Robustness based Ant Colony Optimization Routing for Ad Hoc Networks with GPSs

摘要

We propose a new Ant Colony Optimization (ACO) routing algorithm for mobile ad hoc networks (MANETs) with GPSs. In ACO routing, a data packet is transferred along a path selected with probability based on the amount of pheromone, which is laid down by ants depending on quality of the path. In existing ACO routing algorithms, the quality of a path is evaluated from its number of hops and communication delay. However, in MANETs, it is essential to construct paths in which no link disconnection is expected to occur for a long time since nodes move continuously. Therefore, we propose an ACO routing algorithm based on robustness of paths: each ant evaluates robustness of a path as its quality by GPS information of visited nodes. Moreover, in our algorithm, each node predicts a link disconnection to redistribute pheromone on a link to be disconnected so that construction of alternative paths can be accelerated. Simulation results show that our algorithm achieves higher packet delivery ratio with lower communication cost than AntHocNet.