Performance Analysis of DSR Using Reclaim-Based Caching Policy on the MANET

A MANET is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration. How to obtain an effective and efficient routing protocol in MANET remains a big challenge. At present, DSR serves as the more commonly accepted route protocol. Good routing results for simple and easy operations are frequently achieved in a small-scale MANET environment not in large-scale network. In order to solve this problem, we focused on the caching strategy of DSR, and attempted to verify and validate a recoverable caching mechanism called reclaim-based caching (RBC). The purposes of RBC are to increase the usages of cache and to decrease the occurrence of broadcasting due to temporarily broken link on nodes mobility. Hence, we gathered all feasible and historical routes into the cache library. Then, we did perform the simulation and make an analysis on the route discovery as well as the cost of reclaim-based routing in order to determine and regulate the capacity usage of the cache. Ultimately, we expect to utilize the average hit ratio of reclaim-based routing in designing a set of more efficient routing cache mechanism. Consequently, the proposed RBC can be used in the universal wireless network environment to achieve better routing performance and to provide a more flexible application