Research On Routing Algorithm In Ad Hoc Network Based On Improved Ant Colony Algorithm

Mobile Ad Hoc network is a multi-hop wireless network which is self-organized, no center, no base station to support. This network can work in the condition of the node topology change greatly, and are more widely used among the various fields. Each node of the ad hoc network can act as a host or router, and routing technology is a critical problem in mobile ad hoc network.This paper reviews the current proposed researches which based on mobile ad hoc network routing protocols, and elaborated on various routing protocols. Since some multipath selection protocol may be too focused on several particular optimal paths therefore the load is too focused on these paths, which is not benefit data transmission. Too focused on several paths will result in delay increased and the node packet delivery rate reduced. Therefore, a novel multipath routing protocol which based on AOMDV together with improved ant colony algorithm (IACB-AOMDV) proposed in this paper. IACB-AOMDV algorithm using the ant colony algorithm's characteristics of heuristic search path, and proposed the concept of the node connection density factor. When the node density is relatively large, changing the path pheromone which connected to its neighbors adaptively, so pheromone distribution is conducive to different neighbor path, it is in favor of reduce path's load balancing, and on the basis of the reliability of the node to find a number of different paths. We can use backup path in time when the main path disconnect, and it can reduce the cost of re-routing discovery.AOMDV and IACB-AOMDV algorithms will be tested on the NS2, compared their's average end to end delay, packet delivery ratio and packet overhead. The experiment results show that IACB-AOMDV algorithm have lower average end to end, lose packet ration and packet overhead, can improve the network performance.