Abstract
A mobile ad-hoc (MANET) network has the main challenge to provide the needed data for the desired mobile nodes. An efficient on request routing protocol for MANET is Ad-hoc on-demand Distance Vector (AODV), which is based on two main methods: route discovery and route maintenance. Route discovery is the process used to detect a route to the destination from the packet source, while route maintenance is the process used to detect a link failure and repair it. Cooperative caching tends improving data availability in mobile ad-hoc networks, the coordination of cache discovery and cache management strategies is very significant in the cooperative caching of MANETs because requests for data and answers to requested data can be reduced simply due to interference, network congestion, or when a forwarding node is out of reach and the route breaks down. Cooperative cache management is much more complicated in cooperative caching because it also depends on neighbouring nodes to decide what to cache. In this paper, three algorithms were proposed: (1) a combination algorithm for cache admission control based on cache data and location of data to save space and reduce data redundancy, (2) a value-based policy for cache placement and replacement instead of the more common least recently used strategy, depending on metrics that describe cached items to increase the local cache hit ratio, and (3) a combined algorithm for cache consistency that includes time-to-live, pull, and push policies to enhance data availability and system scalability. The proposed algorithm implemented by the NS3 simulation program; which used to create a network using the AODV protocol in several parameters and achieve better system performance.