Exchange Routing Information between New Neighbor Nodes to Improve AODV Performance

In ad hoc on-demand distance vector (AODV) protocol, once an on-demand link is established, it only maintains that link and does not care about any other paths. AODV may not use some more optimal or reserved paths which occur later but may improve its current transfer. We modify AODV that each node uses routing information provided by the new neighbor nodes to find out and update to better paths and create accumulated routes for later use. Our modeling results in NS2 show that the approach can create more optimal routes and significantly improve the performance with high mobility and traffic level network in term of delay and packet delivery ratio.