A Novel Ant Colony Routing Algorithm with Global Correction for Mobile Ad hoc Networks

摘要

The stability and reliability of routing protocols in existence can not be adapted to mobile ad hoc networks (MANET) well enough. In this paper, a novel ant colony routing algorithm is proposed and evaluated to reduce the overhead and enhance the network stability for MANET. The thought of design came into being based on the way of ants foraging and work dividing. By making a global correction on pheromone intensity, we gain a more efficient routing selection mechanism. The results show that, as compared with AODV (Ad Hoc On-demand Vector) routing protocol, the ant colony routing algorithm with a global correction (ACRA-GC) can not only reduce the end-to-end delay, but also enhance the stability and raise the efficiency of communication by exerting the function of each node in MANET.