Ad Hoc Network Routing Based On Ant Colony Optimization

With the Internet and mobile communications technology continues to evolve and progress, mobile computers have become a very active topic for the current communications and computer science technology. Ad hoc network, as a special form of mobile computer network, can be widely used in military command, sensor networks, a number of emergency situations, and personal communications network. Due to the characteristics of the frequency of the node network structure caused by the movement dynamics of Ad hoc networks, routing issue has become a key research and application as well as the difficulties of routing protocol is the communication network is the most crucial and central issue.Based on analysis of the characteristics of Ad hoc networks, study of common routing protocols, This paper summarize the existing problems that exist in routing protocols, and analyse ant-colony algorithm, apply ant colony optimization algorithm to routing protocols. Through a large number of theoretical analysis and the corresponding formula derived, the corresponding algorithm concludes with two kinds of improvements, through simulation, the improved network performance can enable access to a certain degree of upgrading. The main work of this paper is as follows:1. Study of Ad Hoc background, including the Ad Hoc characteristics, architecture and the corresponding key technologies, which focus on key technologies in the routing protocols.2. For Ad Hoc analysis of common routing protocols, including the table-driven protocols and on-demand routing protocols, including the table-driven protocols are DSDV and the ERP agreements, demand-driven agreement AODV, DSR, ABR, TORA agreement.3. Analysis of the basic ant colony optimization algorithm, description of ant colony optimization algorithm, and its principle is analyzed to study the ant colony optimization algorithm for TSP problem in the application of ant colony optimization algorithm describes the realization method of summary introduces about the convergence of ant colony optimization algorithm,. It has concluded that a "three-step" select the optimal combination of parameters of ant colony optimization algorithm for an effective method of using ant colony optimization algorithm to solve optimization problems related fields have a certain reference value, which is very conducive to ant colony optimization in other optimization algorithms in the further promotion and application.4. Based on the Ad Hoc routing introduction and analysis of ant colony optimization algorithm, it applies ant colony optimization algorithm to Ad Hoc routing, the paper presents a routing algorithm based on ant colony optimization. Through the ant colony optimization routing algorithm simulation, data packets on the network, the average end to end delay (average end-to-end delay), packet delivery ratio of data packets (packet delivery ratio) and network routing overhead (routing overhead) are analyzed and compared with AODV, indicating that the algorithm performs better than AODV algorithm. In the simulation of ant colony optimization algorithm based on the algorithm based on the parameters of the algorithm and the convergence rate of the overall situation analysis, propose an improved ant colony optimization routing algorithm, simulation results show that the improved method to obtain a certain degree The performance improvements. Analysis of the current most of the routing algorithm, most of them are based on a minimum number of hops as the selection criteria, but due to the limitations of a path, so Section 4.5 presents a residual energy of node-based ant colony optimization routing algorithm, the node residual energy by adding pheromone update. The simulation shows that, based on residual energy of the ant colony optimization routing algorithm can get performance improvements.