Robustness Based Ant Colony Optimization Routing for Ad Hoc Networks With GPSs

The authors 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.