Study Qos Routing Based On Improved Ant Colony Algorithm In Wireless Mesh Network

The Wireless Mesh Network (WMN) is a new type of wireless communication network with features as no-centre, self-mechanism and dynamic topology, which cause the seeking route to be a key and vital point in its research and application, of which the routing algorithm is the key.This thesis focused on the QoS based on improved ant colony algorithm to solve routing problems in the Wireless Mesh Network, the binding parameters include bandwidth, delay, delay jitter, cost, packet loss rate. Qos routing is a problem to meet the multiple constraints in Wireless Mesh Network. How to meet the requirements of multi-constrained QoS routing under the premise, the present is difficult to effectively solve the general routing algorithm, commonly used heuristic algorithm to solve.Ant colony algorithm is a novel heuristic algorithm for self-motivation, it does not depend on the specific mathematical description of nature with the global optimization and the advantages of parallelism. But the ant colony algorithm itself is slow convergence and easy local convergence shortcomings.In order to overcome the faults of ant colony algorithm, thesis proposes a QoS based on improved ant colony algorithm routing algorithm. Ant colony optimization algorithm transfer rules and adjust the pheromone update rule. The global pheromone update strategy, in addition to the path of previous pheromone update the optimal solution, the solution of the worst ever the same path the pheromone update. By using this two-way convergence strategy, will help accelerate the convergence speed. The improved algorithm uses the nearest access point strategy selection Mesh router nodes and enhance the network robustness. Simulation results show that the improved ant colony algorithm, compared with the traditional ant colony algorithm can be better optimization of network resources and to meet the needs of QoS routing.