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

Wireless network technology is developing rapidly, and allows customers to get into the network more easily and more flexible. Ad Hoc is a special multiple hop Wireless Mobile Self-organizing Network (WMSN), which is the aggregation of hardware and software that include wireless transmitter-receivers and computers. WMSN is mainly applied to telemediine, emergency and military wireless communication. Nowadays, there is a great amount of research work about Ad Hoc networks, in which many focus on routing protocol behavior design. The selection of the most efficient and the most easy-to-implement routing protocol algorithm is very crucial for the validity and the feasibility of the research.Route acquisition is a key and difficult problem in Ad Hoc networks, because the nodes of Ad Hoc network always move frequently. According to these problems wo are going to seek a rapid, exact, effectual and expandable routing protocol, which can give well stability and reliability in Ad Hoc network.Aim at the problems of great overhead and the lower stability in Ad Hoc routing technology, an improved ant colony algorithm is proposed to study an ant-based Ad Hoc routing protocol. In our algorithm, the ant foraging, labor division and task allocation algorithm is the basic designation thinking. Compared with the AODV(Ad Hoc On-Demand Distance Vector)routing protocol which is a very mature strategy in Ad Hoc study, Simulation results show that by bringing the node colony function into play,the routing overhead is reduced and the packet delivery rate is increased. The network performances, such as the stability and the efficiency, are improved obviously. Therefore the improved ant colony routing protocol have a potential applications in Ad Hoc networks.