Poulose Jacob,K; Preetha Theresa, Joy(International Journal of Ad hoc, Sensor & Ubiquitous Computing, August 1, 2012)
[+]
[-]
Abstract:
Data caching is an important technique in mobile computing environments for improving data
availability and access latencies particularly because these computing environments are characterized
by narrow bandwidth wireless links and frequent disconnections. Cache replacement policy plays a vital
role to improve the performance in a cached mobile environment, since the amount of data stored in a
client cache is small. In this paper we reviewed some of the well known cache replacement policies
proposed for mobile data caches. We made a comparison between these policies after classifying them
based on the criteria used for evicting documents. In addition, this paper suggests some alternative
techniques for cache replacement
Description:
International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.3, No.4, August 2012
Poulose Jacob,K; Preetha Theresa, Joy(IEEE, July 18, 2012)
[+]
[-]
Abstract:
Data caching can remarkably improve the
efficiency of information access in a wireless ad hoc
network by reducing the access latency and bandwidth
usage. The cache placement problem minimizes total data
access cost in ad hoc networks with multiple data items.
The ad hoc networks are multi hop networks without a
central base station and are resource constrained in terms
of channel bandwidth and battery power. By data caching
the communication cost can be reduced in terms of
bandwidth as well as battery energy. As the network node
has limited memory the problem of cache placement is a
vital issue. This paper attempts to study the existing
cooperative caching techniques and their suitability in
mobile ad hoc networks.
Description:
Data Science & Engineering (ICDSE), 2012 International Conference on
Data caching is an attractive solution for reducing bandwidth demands and
network latency in mobile ad hoc networks. Deploying caches in mobile nodes can reduce
the overall traf c considerably. Cache hits eliminate the need to contact the data source
frequently, which avoids additional network overhead. In this paper we propose a data
discovery and cache management policy for cooperative caching, which reduces the power
usage, caching overhead and delay by reducing the number of control messages flooded into the network .A cache discovery process based on position cordinates of neighboring nodes is developed for this .The stimulstion results gives a promising result based on the metrics of the studies.
Poulose Jacob,K; Preetha Theresa, Joy(IEEE, July 6, 2013)
[+]
[-]
Abstract:
Cooperative caching is an attractive solution for
reducing bandwidth demands and network latency in mobile
ad hoc networks. Deploying caches in mobile nodes can reduce
the overall traffic considerably. Cache hits eliminate the need
to contact the data source frequently, which avoids additional
network overhead. In this paper we propose a data discovery
and cache management policy for cooperative caching, which
reduces the caching overhead and delay by reducing the
number of control messages flooded in to the network. A cache
discovery process based on location of neighboring nodes is
developed for this. The cache replacement policy we propose
aims at increasing the cache hit ratio. The simulation results
gives a promising result based on the metrics of studies
Description:
Advanced Infocomm Technology (ICAIT), 2013 6th International Conference on
Cooperative caching is used in mobile ad hoc networks to reduce the latency perceived by the
mobile clients while retrieving data and to reduce the traffic load in the network. Caching also
increases the availability of data due to server disconnections. The implementation of a
cooperative caching technique essentially involves four major design considerations (i) cache
placement and resolution, which decides where to place and how to locate the cached data (ii)
Cache admission control which decides the data to be cached (iii) Cache replacement which
makes the replacement decision when the cache is full and (iv) consistency maintenance, i.e.
maintaining consistency between the data in server and cache. In this paper we propose an
effective cache resolution technique, which reduces the number of messages flooded in to the
network to find the requested data. The experimental results gives a promising result based on
the metrics of studies.
In this paper we investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In our
vision cache resolution should satisfy the following requirements: (i) it should result in low message
overhead and (ii) the information should be retrieved with minimum delay. In this paper, we show that
these goals can be achieved by splitting the one hop neighbours in to two sets based on the transmission
range. The proposed approach reduces the number of messages flooded in to the network to find the
requested data. This scheme is fully distributed and comes at very low cost in terms of cache overhead. The
experimental results gives a promising result based on the metrics of studies.
Description:
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 5, No. 5, October 2013