QoS routing problem in Ad hoc networks including such constraints as delay

delay jitter

bandwidth and packet loss is an NP-complete problem.It is difficult for the traditional plane QoS ant routing algorithm to solve the contradiction between improving the global search ability of the algorithm and speeding up the convergence rate.In relation to the above problem

this paper presents a Hierarchical QoS Ant Colony（HQAC）algorithm.On the basis of the hierarchical structure

it improves the routing search process of the algorithm and optimizes the pheromone update formula.Simulation results show that compared with the traditional QoS routing algorithms

this algorithm is remarkably improved in searching the global optimal solution

especially in convergence rate and other performances.