OPTIMAL DATA REPLACEMENT TECHNIQUE FOR COOPERATIVE CACHING IN MANET
Abstract
vioft2nntf2t|tblJournal|Abstract_paper|0xf4ff9ebe17000000973f030001000900
A cooperative caching approach improves data accessibility and reduces query latency in Mobile Ad hoc Network (MANET). Maintaining the cache is challenging issue in large MANET due to mobility, cache size and power. The previous research works on caching primarily have dealt with LRU, LFU and LRU-MIN cache replacement algorithms that offered low query latency and greater data accessibility in sparse MANET. This paper proposes Memetic Algorithm (MA) to locate the better replaceable data based on neighbours interest and fitness value of cached data to store the newly arrived data. This work also elects ideal CH using Meta heuristic search Ant Colony Optimization algorithm. The simulation results shown that proposed algorithm reduces the latency, control overhead and increases the packet delivery rate than existing approach by increasing nodes and speed respectively.

Authors
P. Kuppusamy1, B. Kalaavathi2, S. Chandra3
Gnanamani College of Technology, India1, K.S.R. Institute of Engineering and Technology, India2, Selvam Arts and Science College, India3

Keywords
Replacement, Clustering, Cooperative Caching, Optimization
Yearly Full Views
JanuaryFebruaryMarchAprilMayJuneJulyAugustSeptemberOctoberNovemberDecember
000000000000
Published By :
ICTACT
Published In :
ICTACT Journal on Communication Technology
( Volume: 5 , Issue: 3 , Pages: 995-999 )
Date of Publication :
September 2014
Page Views :
232
Full Text Views :

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.