scispace - formally typeset
Open AccessProceedings ArticleDOI

Supporting cooperative caching in ad hoc networks

Liangzhong Yin, +1 more
- Vol. 4, pp 2537-2547
TLDR
A hybrid approach (HybridCache) is proposed, which can further improve the performance by taking advantage of CacheData and CachePath while avoiding their weaknesses, and can significantly reduce the query delay and message complexity when compared to other caching schemes.
Abstract
Most researches in ad hoc networks focus on routing, and not much work has been done on data access. A common technique used to improve the performance of data access is caching. Cooperative caching, which allows the sharing and coordination of cached data among multiple nodes, can further explore the potential of the caching techniques. Due to mobility and resource constraints of ad hoc networks, cooperative caching techniques designed for wired network may not be applicable to ad hoc networks. In this paper, we design and evaluate cooperative caching techniques to efficiently support data access in ad hoc networks. We first propose two schemes: cachedata which caches the data, and cachepath which caches the data path. After analyzing the performance of those two schemes, we propose a hybrid approach (hybridcache) which can further improve the performance by taking advantage of cachedata and cachepath while avoiding their weaknesses. Simulation results show that the proposed schemes can significantly reduce the query delay and message complexity when compared to other caching schemes.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A survey of context data distribution for mobile ubiquitous systems

TL;DR: A unified architectural model and a new taxonomy for context data distribution are presented by considering and comparing a large number of solutions and some of the research challenges still unsolved are drawn and identify some possible directions for future work.
Journal ArticleDOI

Cooperative Edge Caching in User-Centric Clustered Mobile Networks

TL;DR: In this paper, a delay-optimal cooperative edge caching in large-scale user-centric mobile networks, where the content placement and cluster size are optimized based on the stochastic information of network topology, traffic distribution, channel quality, and file popularity, is proposed.
Journal ArticleDOI

Data Pouring and Buffering on the Road: A New Data Dissemination Paradigm for Vehicular Ad Hoc Networks

TL;DR: This paper proposes a data pouring (DP) and buffering paradigm to address the data dissemination problem in a VANET and provides analytical models to explore the dissemination capacity of the proposed schemes.
Proceedings ArticleDOI

ContentPlace: social-aware data dissemination in opportunistic networks

TL;DR: This paper proposes and evaluates ContentPlace, a system that exploits dynamically learnt information about users' social relationships to decide where to place data objects in order to optimise content availability, and defines a number of social-oriented policies in the general ContentPlace framework.
Journal ArticleDOI

An Edge Caching Scheme to Distribute Content in Vehicular Networks

TL;DR: A cross-entropy-based dynamic content caching scheme is proposed accordingly to cache the contents at the edge of VCNs based on the requests of vehicles and the cooperation among RSUs and the performance of the proposed scheme is evaluated by extensive simulation experiments.
References
More filters

Ad hoc On-Demand Distance Vector (AODV) Routing

TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.

Dynamic Source Routing in Ad Hoc Wireless Networks.

TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI

Dynamic Source Routing in Ad Hoc Wireless Networks

TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Proceedings ArticleDOI

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Proceedings ArticleDOI

Directed diffusion: a scalable and robust communication paradigm for sensor networks

TL;DR: This paper explores and evaluates the use of directed diffusion for a simple remote-surveillance sensor network and its implications for sensing, communication and computation.
Related Papers (5)