Optimization Strategy for AODV Routing Protocol Based on Modified Ant Colony Algorithm

The Ad hoc On-Demand Distance Vector (AODV) routing protocol doesn't consider the node itself condition in the route discovery. So it may cause some local nodes congestion, thus affects the whole transmission characteristic of the net: Meanwhile, in high-speed mobile network conditions, due to the dynamic change of topology structure, causes the communication link expire frequently, therefore increased the transmission latency greatly. This paper combines with ant colony algorithm, based on AODV routing protocol, proposed a modified routing protocol. The modified routing protocol considers the node routing load, remaining power, routing hop count, and so on. In the route discovery stage, the downward node in communication link makes the judgment to its own situation, avoids the node blindly processing route request: with the improved ant algorithm, the modified routing protocol makes the source node establish many ways to the destination node. Finally, the NS2 simulation shows that the modified protocol reduces the average delay, routing load and packet loss rate while increasing the data forwarding capacity of nodes.