Ant colony algorithm shows outstanding performance and great potential in combinatorial optimization problems, so it is suitable for routing design of Ad Hoc network.For the frequent topology changes of Ad Hoc network and the inherent shortcomings of ant colony algorithm, a self-adaptive routing algorithm based on ant colony algorithm is proposed. The structure of routing table and pheromone updates are improved. The probabilistic selection and random selection are considered into ants’search strategy, and the ratio between them is adjusted adaptively to strengthen the initial global search capability and avoid falling into local optimum. Simulation results show that the algorithm performs well.To solve QoS multicast routing problem of Ad Hoc network, artificial immune algorithm is integrated with ant colony algorithm, considering the rapid random global search ability of artificial immune algorithm. Some better feasible solutions are found by using artificial immune algorithm, then initial pheromone distribution is generated to accelerate the convergence rate of ant colony algorithm. In process of looking for the optimal solution, the idea of antibody exclusion is used to avoid getting into local optimum. Simulation results show that the algorithm has a better ability to find excellent routings.
