Self-adaptive ant colony optimization routing algorithm for mobile Ad Hoc network

An improved routing algorithm based on ant colony algorithm is proposed for the shortcomings of ant algorithm.To avoid getting into local optimal solutions and searching too long,accelerate the convergence rate,self-adaptive factor is added to improve search strategy,time delay is taken fully into account for information updating process and routing table is modified.By comparing the improved routing algorithm with DSR and AODV,simulation results show that the proposed algorithm is reasonable and efficient.