Improved Ant Colony Algorithm In The Application Of Ad Hoc Network Routing

Ad Hoc network is a multi-hop, temporary self-organized network, composed of a plurality of mobile terminals and can rely on their own to send or receive information. Because, all nodes in the network can move freely and the equal status, therefore, in the network do not need to set up a central control node. Ad Hoc network is a kind of special wireless communication network, can be passed between nodes are connected to form the wireless network topology. Ad Hoc network due to the rapid construction of mobile network, is not affected by the surrounding environment advantage, and does not require the existing communication infrastructure support, has strong robustness and invulnerability, therefore this temporary autonomous communication mode to get the attention of people, is a wireless communication network research direction. In the Ad Hoc network allows all nodes to join or leave and nodes can be moved freely, resulting in the network topology changes ceaselessly, Ad Hoc and the particularity of the traditional network routing protocol cannot be used, at the same time as the mobile node’s computing power and storage information capacity is low, and the energy is limited, requirements of new routing protocol algorithm as simple as possible. Therefore, how to design a suitable for Ad Hoc features and simple algorithm routing protocol for Ad Hoc network routing protocol, is an important research subject.Ant colony algorithm is adopted to simulate the real ants foraging behavior, and proposed a swarm intelligence optimization algorithm. The algorithm is adaptive, positive feedback, robustness and essentially parallel and many other advantages. It does not depend on the specific problems in the mathematical description, which can be used by itself to searching method to construct data model, with global optimization and search ability, in solving combinatorial optimization problems has unique properties and great potential for development, through the use of ant simulated Ad Hoc node in the network, the network model is established, in Ad Hoc network the design of routing algorithm has a natural advantage.According to the Ad Hoc network node communication and ant foraging process similarity, this paper presents a method based on adaptive Ad Hoc ant routing algorithm. In the improved ant colony algorithm with fish-eye technology on the network node in the routing table structure and pheromone updating methods are improved, and the combination of solving TSP problem ant colony algorithm in application of the local selection strategy and the random choice of search strategy, simulation of communication between network nodes.In this paper, an improved ant colony algorithm to complete the main work is the routing problem by ant colony algorithm, positive volatilization mechanism and reverse accumulation mechanism using pheromone update strategy, improve the convergence speed, by the normal function of the volatile pheromone strategy, enhance ants explore new path capacity; at the same time with Ad Hoc network routing node characteristics, causes it to adapt the demands of QoS, reduce the network congestion degree, improve the quality of network service.Part of the experiment is mainly divided into two parts:(1) using improved ant colony algorithm simulation of ant foraging obstacles encountered in the process of the situation, as well as in the TSP combinatorial optimization problem in performance.(2) using a combination of fish-eye technology improved ant colony algorithm, simulation of Ad Hoc network performance. The experimental results show that the improved ant colony algorithm has good robustness and effectiveness, the specific issue of good performance.