By Topic

An Ant Simulated Annealing Routing Algorithm for Wireless Mesh Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ye Zhao ; Sch. of Comput. & Inf., HeFei Univ. of Technol., Hefei, China ; Rui Sun ; Liangfeng Xu

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.

Published in:

Internet Technology and Applications, 2010 International Conference on

Date of Conference:

20-22 Aug. 2010