Cooperative Cache Replacement Policy for MANETs

Cooperative Cache Replacement Policy for MANETs

Prashant Kumar (Department of Computer Science and Engineering National Institute of Technology, Hamirpur, Himachal Pradesh, India), Naveen Chauhan (Department of Computer Science and Engineering National Institute of Technology, Hamirpur, Himachal Pradesh, India), LK Awasthi (Department of Computer Science and Engineering National Institute of Technology, Hamirpur, Himachal Pradesh, India) and Narottam Chand (Department of Computer Science and Engineering National Institute of Technology, Hamirpur, Himachal Pradesh, India)
DOI: 10.4018/ijapuc.2014040103
OnDemand PDF Download:
No Current Special Offers


Mobile Adhoc Networks (MANETs) are autonomously structured multi-hop wireless links in peer to peer fashion without aid of any infrastructure network. In MANETs network topology is dynamic, as nodes are mobile. Due to this dynamic topology and multi-hop environment data availability in MANETs is low. Caching of frequently accessed data in ad hoc networks is a potential technique that can improve the data access, performance and availability. While caching the new data items, it is very important which data item is to be removed, as in MANETs the data is not stored only on behalf of caching node but interest of the vicinity is also considered. In this paper the authors presented a new cache replacement policy for MANETs. This policy is based on multi-parameter value called SAT. We simulate the proposed work on OMNET++ and the simulation results shows that proposed replacement policy helps to improve the data availability in network.
Article Preview


MANETs stands for “Mobile Ad Hoc Networks”. A MANETs is a type of ad hoc network that can change locations and configure itself on the fly. With the increase of portable devices as well as progress in wireless communication, ad-hoc networking is gaining importance with the increasing number of widespread applications. Ad-hoc networking can be applied anywhere where there is little or no communication infrastructure or the existing infrastructure is expensive or inconvenient to use. Because MANETs are mobile, they use wireless connections to connect to various networks. Some MANETs are restricted to a local area of wireless devices (such as a group of laptop computers), while others may be connected to the Internet. For example, A VANET (Vehicular Ad Hoc Network) is a type of MANETs that allows vehicles to communicate with roadside equipment. While the vehicles may not have a direct Internet connection, the wireless roadside equipment may be connected to the Internet, allowing data from the vehicles to be sent over the Internet. The vehicle data may be used to measure traffic conditions or keep track of trucking fleets. Because of the dynamic nature of MANETs, they are typically not very secure, so it is important to be cautious what data is sent over a MANETs. Figure 1 shows two different scenarios of a typical structure of MANETs.

Figure 1.

A typical MANETs


In adhoc networks, mobile nodes communicate with each other using multi-hop wireless links. As there is no infrastructure support, mobile nodes cooperate with each other to forward data. Each node acts as a router, forwarding data packets for other nodes and mobile nodes have peer to peer connection among themselves. Most previous research in ad hoc networks focused on the development of dynamic routing protocols that can efficiently find routes between two communicating nodes. Although routing is an important issue, but the ultimate goal of adhoc networks is to provide mobile nodes with access to information.

However, MANETs are limited by intermittent network connections, restricted power supplies, and limited computing resources. These restrictions raise several new challenges for data access applications with the respects of data availability and access efficiency. In adhoc networks, due to frequent network partition, data availability is lower than that in traditional wired networks. Cooperative caching provides an attractive solution for this problem. Cooperative caching is a technique that allows the sharing and coordination among the mobile nodes.

However, the movement of nodes, limited storage space and frequent disconnections limit the availability. By the caching of frequently accessed data in adhoc networks we can improve the data access, performance and availability. Due to mobility and resource constraints of adhoc networks, caching techniques designed for wired network may not be applicable to ad hoc networks.

Consider a scenario in which mobile devices always retrieve data from the data center. This may result in a large amount of traffic in the network. This, apparently, is undesirable as traffic directed to the data center consumes wireless bandwidth as well as power of mobile devices. In addition, a mobile host suffers from high access latency if it is distant from the data center, and packet loss probability for long-distance data access is high. Furthermore, traffic near the data center will be heavy, and this leads to a potential performance bottleneck. These problems are more pronounced when the network size is large, which results in poor scalability of the system. The above observations motivate us to investigate a new data caching technique for MANETs. With data cached in mobile nodes, a data request may be satisfied by a nearby mobile node, instead of being serviced by the data center. By cooperative caching the data we can:

  • 1.

    Improve the data availability.

  • 2.

    Improve the data access time.

  • 3.

    Reduce the traffic near the data center.

  • 4.

    Reduce the consumption of bandwidth.

In general, a good cooperative cache management technique for MANETs should address these issues:

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing