Based On The Improved Evolution Of Ant Colony Algorithm For Wireless Ad Hoc Network Multicast Routing Study

With rapidly development of computer network technology and multimedia applications , the public demand on the network no longer limited to a wired network, wireless ad hoc networks' proposed and widely used have become a useful supplement to the wired network technologies. Wireless ad hoc network is a dynamic multi-hop network , compared with the traditional cellular network, the wireless ad hoc network without fixed infrastructure and routers, it is an autonomous system by the mobile host itself through wireless connection, and the mobile host itself not only as a router, is also a communication terminal node. Because the mobile host is dynamic in the wireless ad hoc network, it is easy to make the network topological structure movement as the host changes, leading to limited the bandwidth provided by the host itself. Wireless ad hoc network routing algorithm of the agreement is particularly important.In addition, with the development and rapidly spread of the application of multimedia technology, the data volume, intensity and duration of the delay sensitive issue with multimedia services can not be ignored, so to ensure the quality of service in wireless ad hoc network is also very important and urgent. The multicast routing is a key technology to solve the quality of service problem in wireless network. Unlike the traditional multicast unicast and broadcast technology, multicast technology is a network technology with one point to many points, many points to many points, it can save the network bandwidth resources effectively. Because the characteristics of wireless ad hoc network and QoS multicast routing, wireless ad hoc network QoS multicast routing problem is not only a problem of multiple constraints to satisfy, but also a NP complete problem, the traditional routing algorithm can not effectively to solve. Evolutionary algorithm and ant colony algorithm for solving NP complete problems as the effective tools, has got the attention of many researchers. This paper studies in depth of existing network multicast routing algorithm is proposed, and proposed a wireless ad hoc network QoS multicast routing algorithm based on the improved evolutionary algorithm and ant colony algorithm(IEAMRA). This algorithm overcomes the traditional routing algorithms in solving wireless since networking QoS multicast routing deficiency of routing, effectively improve the efficiency, save the network resources.The innovation of this paper are as following:1. In this paper proposed a wireless ad hoc network QoS multicast routing algorithm based on the improved evolutionary algorithm and ant colony algorithm, mainly hybrid evolutionary algorithm and improved ant colony algorithm, rational use of the global search capability of evolutionary algorithm and parallelism of improved ant colony algorithm.2. Ant colony algorithm of this paper improved the basic ant colony algorithm, choosing the next step is no longer in accordance with the pervious formula, but set a guiding formula to transfer the state. In the way of pheromone update, the paper is no longer to local update the pheromone on the path after ant completed a step,but introducing a feedback factor, through the feedback message by this feedback factor, avoiding the time which the ants go back. And when the ants completed the searching of a cycle, it is also no longer to global pheromone update the solution,but record the best path and the worst path, update the pheromone on the best path, and reduct the worst paths' pheromone, while guide the ants search better.3. This algorithm is applied to wireless ad hoc network QoS multicast routing problem solving, through compared with the basic genetic ant colony algorithm(GAAC), we can know that the algorithm can enhance the search routing efficiency, and significantly improving the performance of all aspects of the algorithm.