Research On Ad Hoc Routing Hole Based On Ant Colony

Ad Hoc is a multi-hop and temporary mobile autonomous system,it consists of a set of mobilenodes with wireless transceiver. Due to the limited energy of nodes and the frequently changes ofthe network topology. Ad Hoc network also need to consider a lot of problems that traditionalnetworks don’t need to care about, the problem of routing hole is one of them.Routing hole is produced with the development of Ad Hoc network. It can be divided into twocategories according to the causes of holes, one called geographical hole and another called energyhole. The harm of Routing hole in the network show as extending the routing path, increasing thenetwork delay in the early time. In the traditional routing algorithm, more network sessions andnetwork load means that more data would be loaded by the nodes at the edge of the routing hole,which may lead to nodes at the edge of the routing hole dead rapidly because of exhausted energy.Meanwhile the death of nodes at the edge of the routing hole may expand radius of the routing hole,then more network load would be taken by on the nodes on the edge of the routing hole in turn. Inthis vicious circle, routing hole will rapidly expand and led to the end of the network life cycle.This thesis outlined the research background, the structure of the system of Ad Hoc,application field and key technology, the existing two types of Ad Hoc routing algorithm, andintroduces several typical routing algorithms. Then we analysis how the routing hole come intobeing and summary the harm of routing hole. and we introduce GPSR algorithm and its variantswhich aganist routing hole problem, both in its Advantages And Disadvantages. Aim at the aboveproblems, this thesis put forward a kind of avoiding Algorithm of hole based on ant colonyalgorithm which called ACO-GPR. Through the method which called virtual path composed ofvirtual node takes place of the right-hand rule boundary algorithm used in GPRS, at the same timeto join artificial hole into the ant colony algorithm for ACO-GPR to offer a method for searchingmultipath routing. This algorithm improved the problem in GPSR which expand routing holefundamentally. In the paper we make a comparison with GPSR through simulation experiments andtake the transmission delay, control message overhead, energy consumption and network survivaltime as the reference quantity.The simulation results show the improved ACO-GPR algorithm hasbetter performance and efficiency in Ad Hoc when it comes to the network which has routing holes.