Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
On improving the performance of cache invalidation in mobile environments
Mobile Networks and Applications
A cooperative cache architecture in support of caching multimedia objects in MANETs
WOWMOM '02 Proceedings of the 5th ACM international workshop on Wireless mobile multimedia
Proxy Cache Algorithms: Design, Implementation, and Performance
IEEE Transactions on Knowledge and Data Engineering
Cooperative Caching in Ad Hoc Networks
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Energy-efficient caching strategies in ad hoc wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Replica allocation methods in ad hoc networks with data update
Mobile Networks and Applications
A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments
IEEE Transactions on Knowledge and Data Engineering
Locating cache proxies in manets
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A novel state cache scheme in structured P2P systems
Journal of Parallel and Distributed Computing
Broadcast based cache invalidation and prefetching in mobile environment
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Hi-index | 0.00 |
A novel scheme, called Cluster Cooperative (CC), for caching in mobile ad hoc networks is presented. In CC, the network topology is partitioned into non-overlapping clusters based on the physical network proximity. In each cluster, a 'super' node called Cache State Node (CSN) is chosen to maintain the Cluster Cache State (CCS). For a data miss in the local cache, each client searches the data with its CSN before the request is forwarded to the next client that lies along routing path towards source. Simulation experiments show that CC achieves significant improvements in comparison with other caching strategies.