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
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, February 22, 2013)
[+]
[-]
Abstract:
Cooperative caching in mobile ad hoc networks
aims at improving the efficiency of information access by
reducing access latency and bandwidth usage. Cache replacement
policy plays a vital role in improving the performance of a cache
in a mobile node since it has limited memory. In this paper we
propose a new key based cache replacement policy called E-LRU
for cooperative caching in ad hoc networks. The proposed
scheme for replacement considers the time interval between the
recent references, size and consistency as key factors for
replacement. Simulation study shows that the proposed
replacement policy can significantly improve the cache
performance in terms of cache hit ratio and query delay
Description:
Advance Computing Conference (IACC), 2013 IEEE 3rd International
Poulose Jacob,K; Preetha Theresa, Joy(IEEE, February 16, 2014)
[+]
[-]
Abstract:
Cache look up is an integral part of cooperative
caching in ad hoc networks. In this paper, we discuss a
cooperative caching architecture with a distributed cache look up
protocol which relies on a virtual backbone for locating and
accessing data within a cooperate cache. Our proposal consists of
two phases: (i) formation of a virtual backbone and (ii) the cache
look up phase. The nodes in a Connected Dominating Set (CDS)
form the virtual backbone. The cache look up protocol makes use
of the nodes in the virtual backbone for effective data
dissemination and discovery. The idea in this scheme is to reduce
the number of nodes involved in cache look up process, by
constructing a CDS that contains a small number of nodes, still
having full coverage of the network. We evaluated the effect of
various parameter settings on the performance metrics such as
message overhead, cache hit ratio and average query delay.
Compared to the previous schemes the proposed scheme not only
reduces message overhead, but also improves the cache hit ratio
and reduces the average delay
Description:
Advanced Communication Technology (ICACT), 2014 16th International Conference on