Design issues and performance analysis for DSR routing with reclaim‐based caching in MANETs

Abstract

AbstractMobile ad hoc networks (MANETs) have been positioned as one of the most important emerging wireless communication scenarios. Temporally formed by a collection of wireless mobile hosts, a MANET does not require the aid of any centralized administration. From this stems a suite of challenges in achieving an efficient MANET routing and content delivery in order to make the best use of precious resources and reduce the routing overhead at each MANET host. One of the reported approaches for solving the issue is the use of caching, which is expected to minimize the routing overhead by taking advantage of the limited memory at each mobile host. This paper introduces a novel scheme for addressing the above issue, called Reclaim‐Based Caching (RBC) policy, which dynamically utilizes a cache replacement mechanism of reclaiming stale routes to efficiently verify and validate a recoverable caching mechanism in Dynamic Source Routing. The main design purposes of RBC are to reduce the routing control overhead, lower the end‐to‐end routing delay, enhance the packet delivery ratio, and obtain a higher throughput for improving routing performance and accelerating the Route Discovery process due to low temporary link failure and high cache utilization. Hence, we can gather all feasible and historical route information into the cache library to be reclaimed as a threshold of efficient routing control. Consequently, the proposed RBC of this paper can be used in the universal wireless network environment to achieve better routing performance and to provide a more flexible real‐time application. Copyright © 2009 John Wiley & Sons, Ltd.