An Efficient Algorithm for Route Discovery and Mobility Management on Mobile Ad Hoc Networks

In this paper, we developed an efficient algorithm for route discovery and management, and mobility handling for on-demand routing on mobile ad hoc networks (MANET). We applied L-1 and L-2 route caches in each node to manage this algorithm efficiently. For route discovery, we take the content-addressable search feature to access any entry in the route cache in only a few processor cycles. For route maintenance, we applied the LRU replacement policy to maintain route table and to remove the time-to-live parameter in some on-demand protocols such as AODV and DSR. For mobility handling, we developed a sub-algorithm to efficiently handle node addition, deletion and movement in the network. The NS-2 simulation results show that our algorithms outperform other on-demand protocols on packet deliver rate, end-to-end delay and average routing load.