Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
ACM Transactions on Computer Systems (TOCS)
Mobile facility location (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Internet-Based Mobile Ad Hoc Networking
IEEE Internet Computing
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Balancing the Tradeoffs between Data Accessibility and Query Delay in Ad Hoc Networks
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Supporting Cooperative Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Benefit-based Data Caching in Ad Hoc Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
On Modeling Fault Tolerance of Gossip-Based Reliable Multicast Protocols
ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
IEEE Transactions on Wireless Communications
B-SUB: A Practical Bloom-Filter-Based Publish-Subscribe System for Human Networks
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Effects of cache mechanism on wireless data access
IEEE Transactions on Wireless Communications
GroCoca: group-based peer-to-peer cooperative caching in mobile environment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Cooperative caching is an efficient way to improve the performance of data access in mobile wireless networks, by cache nodes selecting different data items in their limited storage in order to reduce total access delay. With more demands on sharing a video or other data, especially for mobile applications in an Internet-based Mobile Ad Hoc Network, considering the relations among data items in cooperative caching becomes more important than before. However, most of the existing works do not consider these inherent relations among data items, such as the logical, temporal, or spatial relations. In this paper, we present a novel solution, Gossip-based Cooperative Caching (GosCC) to address the cache placement problem, and consider the sequential relation among data items. Each mobile node stores the IDs of data items cached locally and the ID of the data item in use into its progress report. Each mobile node also makes use of these progress reports to determine whether a data item should be cached locally. These progress reports are propagated within the network in a gossip-based way. To improve the user experience, GosCC aims to provide users with an uninterrupted data access service. Simulation results show that GosCC achieves better performance than Benefit-based Data Caching and HybridCache, in terms of average interruption intervals and average interruption times, while sacrificing message cost to a certain degree.