Ant colony algorithm in MANET-local link repairing of AODV

Mobile ad hoc network (MANET) is the latest application of telecommunication. This is one of the most innovative and challenging area of wireless networking. Ant Colony Algorithm has been used in Mobile Network since long because of isomorphism between them. Pheromone graph and stigmergic architecture of ant colony algorithm are comparable with structure & constraints of communication network. Most of the researchers applied ACO in the process of route discovery and in load balancing. Work on alternate route finding from the nearer of the faulty node is still untouched. In this proposed work, ACO will be used in case of link failure. Routing table at each will collect additional information of the next two node, which can be updated by RREP. In case of link failure an alternate route for next to next node can be searched by applying ACO. Using this method, throughput, and end to end delay parameters can be improved. Probably overhead parameter will also improve as control packets used in this case are only forward ants and backward ants. On the other hand control packets transmitted in pure AODV are RERR and R-RREQ (RREQ in case of route failure) will reduce.