Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/15676
Title: An efficient caching strategy in mobile ad hoc networks based on clusters
Authors: Chand N.
Joshi R.C.
Misra M.
Published in: Proceedings of 2006 IFIP International Conference on Wireless and Optical Communications Networks
Abstract: We propose a novel scheme, called cluster cooperative (CC) for caching in mobile ad hoc networks where network topology is partitioned into non-overlapping clusters. In each cluster a "super" node called cache state node (CSN) is chosen to maintain the cluster cache state (CCS) information for nodes within its cluster domain. For a local cache miss, each client checks the data with its home CSN before forwarding the request towards server. Simulation experiments show that the CC caching mechanism achieves significant improvements in average query latency and reduces the cache management overheads in comparison with other caching strategies. ©2006 IEEE.
Citation: Proceedings of 2006 IFIP International Conference on Wireless and Optical Communications Networks, (2006). Bangalore
URI: http://repository.iitr.ac.in/handle/123456789/15676
Issue Date: 2006
Keywords: Ad hoc networks
Admission control
Cluster
Consistency
Cooperative caching
Replacement
ISBN: 1424403405; 9781424403400
Author Scopus IDs: 9738427700
7202084587
56223635000
Author Affiliations: Chand, N., Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee 247 667, India
Joshi, R.C., Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee 247 667, India
Misra, M., Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee 247 667, India
Corresponding Author: Chand, N.; Department of Electronics and Computer Engineering, Indian Institute of Technology, Roorkee 247 667, India; email: nchand@ieee.org
Appears in Collections:Conference Publications [CS]

Files in This Item:
There are no files associated with this item.
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.