Efficient on-demand cache routing for mobile ad hoc networks
Fenglien Lee, Carl Swanson, Jigang Liu · 2009
In this paper, we developed an efficient algorithm for route discovery and management, and mobility handling for on-demand cache 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 developed a simpler and more efficient broadcast approach than in AODV (Ad-hoc On-demand Distance Vector Routing). We take the content-addressable search feature in cache to access any entry in the route cache in only a few processor cycles. For route maintenance, we applied the LRU replacement policy in caches to maintain route table and to remove the time-to-live parameter in some on-demand protocols such as AODV and DSR (Dynamic Source Routing). For mobility handling, we developed a sub-algorithm to handle node addition, deletion and movement in the network efficiently. The NS-2 simulation results show that our algorithms outperform other on-demand protocols on packet delivery rate, end-to-end delay and average routing load.