An Ant Simulated Annealing Routing Algorithm for Wireless Mesh Network

Considering the instability of link quality, a new routing algorithm for WMN, namely ASA, based on Ant Colony Optimization algorithm(ACO) and simulated annealing algorithm(SA) was presented. This algorithm not only combined the adaptation, robustness and distributed, decentralized merit of ACO but also used SA to remedy the weakness of ant algorithm and increase the convergence rate of ACO. Simulation results show that this algorithm improves the network´s reliability, robustness and corresponded adaptive ability, and outperforms others in terms of packet delivery ratio, total end-to-end delay and routing overhead quantitative.