Ant Colony Algorithm And A * Algorithm In Ad-hoc Network Research

In the applicated scene of the Ad Hoc network, such as the system of capacity traffic. there is a main control center and all the cars or the buses in the site. The character of them is moving and moving on the road. The task of the system is provide something about the traffic. So route acquisition is a key and difficult problem in Ad Hoc networks, because the nodes always move frequently, which result in the network topology variety.And a network routing protocol is the pivotal and core issue for realizing the Ad Hoc communication. An effective routing protocol is important, which can shield upper layer application from the lower layer bad factors and can supply a stable, reliable and high efficient communication.Many of the existing proposed routing protocols could not give well stability and reliability in Ad Hoc network, so the routing's scalability is restricted, and the network throughput is low. Most of the existing protocols could not fit the Ad Hoc network very well. Aim at the problems of great overhead and the lower stability in Ad Hoc routing technology, this thesis used ant colony algorithm to study an ant-based Ad Hoc routing protocol, based on the AODV routing protocol which is a very mature strategy in Ad Hoc study area, and in our algorithm, the ant foraging, labor division and task allocation algorithm is the basic designation thinking. The stability, reliability and communication efficiency could grow by bringing the node colony function into play.First, some basic Ad Hoc network conceptions were summarized in this thesis, and some hot points and issues in this area were concluded, then some study points in this thesis were given. A simulation and evaluation scheme was put for protocol test and evaluation expediently, and some simulation models and their adaptability were expounded.Because there were a lot of study works in Ad Hoc routing protocol area, some typical Ad Hoc routing protocols were introduced and analyzed. Some simulations were done using NS-2 for investigating these algorithms, and then some conclusions were obtained, which could be used in protocol design.This thesis introduced the origin of the intelligence computing and swarm intelligence, and their basic theory. Then the basic rules and ways of ant algorithm were presented, and some examples to illustrate the application potentials of ant algorithm were given. Some Ad Hoc ant based protocols were described, the capability of these protocols were analyzed and pointed some problems and the limitations.This thesis presents a new ad-hoc routing protocol based on the AODV.which is different from the relation works in this area.When Ad Hoc ant routing was designated.a distinct visual angle to review the ant colony Algorithm was used.some useful ways for Ad Hoc routing were obtained.This new protocol rebuilt the AODV routing acquisition and maintenance based on the ant foraging algorithm.and using ant task allocation algorithm to decrease the maintenance overhead.At last.some simulations were done to validate the protocol.and the simulation results showed that the new protocol obtained good stability and reliability and the communication overhead is lower.the efficiency is high!The paper aimed to the merit of astar algorithm and the characters of Ad hoc. improved the astar algorithm.in order to suit to the Ad Hoc network. Then add a data segment to the format of data packets. Then put forward a algorithm of Ad Hoc based on astar algorithm. At last, testified the effect of altorithm through the experiment.