Cooperative Caching in Ad Hoc Networks

Sailhan, Françoise; Issarny, Valérie

doi:10.1007/3-540-36389-0_2

Cited by 117 publications

(74 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…has appeared in the literature in the past few years [6,9,10,[14][15][16][17]19]. Most of these efforts, however, have focused on developing routing protocols to increase connectivity among MTs in a constantly varying topology.…”

Section: Manetsmentioning

confidence: 99%

“…To overcome the limited information availability in MANET MANETs, Sailhan et al [19] proposed a cooperative caching scheme to increase data accessibility by peer-to-peer communication among MTs, when they are out of bound of a fixed infrastructure. It is implemented on top of a wellknown ad hoc routing protocol, called Zone Routing Protocol (ZRP).…”

Section: Related Workmentioning

confidence: 99%

“…We assume that an MT can not only connect to the Internet but also can forward a message for communication with other MTs via a wireless LAN (e.g. IEEE 802.11), as used in most prior study [19,14,13]. As illustrated in Fig.…”

Section: System Modelmentioning

confidence: 99%

See 2 more Smart Citations

A novel caching scheme for improving Internet-based mobile ad hoc networks performance

et al. 2006

View full text Add to dashboard Cite

Internet-based mobile ad hoc network (IMANET IMANET) is an emerging technique that combines a wired network (e.g. Internet) and a mobile ad hoc network (MANET MANET) for developing a ubiquitous communication infrastructure. To fulfill usersÕ demand to access various kinds of information, however, an IMANET IMANET has several limitations such as limited accessibility to the wired Internet, insufficient wireless bandwidth, and longer message latency. In this paper, we address the issues involved in information search and access in IMANETSIMANETS. An aggregate caching mechanism and a broadcast-based Simple Search (SS) algorithm are proposed for improving the information accessibility and reducing average communication latency in IMANETS IMANETS. As a part of the aggregate cache, a cache admission control policy and a cache replacement policy, called Time and Distance Sensitive (TDS) replacement, are developed to reduce the cache miss ratio and improve the information accessibility. We evaluate the impact of caching, cache management, and the number of access points that are connected to the Internet, through extensive simulation. The simulation results indicate that the proposed aggregate caching mechanism can significantly improve an IMANET IMANET performance in terms of throughput and average number of hops to access data items.

show abstract

Section: Manetsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A novel caching scheme for improving Internet-based mobile ad hoc networks performance

et al. 2006

View full text Add to dashboard Cite

show abstract

“…One effective and widely-used method to improve system performance is to cache frequently accessed data objects at the data source (gateway node) and a group of caching nodes [1,2,3]. Thus, other mobile users can access the cached data objects nearby, with reduced query latency and traffic overhead.…”

Section: Introductionmentioning

confidence: 99%

Achieving Flexible Cache Consistency for Pervasive Internet Access

Huang

Cao

Wang

et al. 2007

Fifth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom'07)

View full text Add to dashboard Cite

show abstract

“…Caching and replication have been considered in ad hoc networks [23], [11], [18]. The problem setup is different in ad hoc networks.…”

Section: Related Workmentioning

confidence: 99%

An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors

Morcos

Atia

Bestavros

et al.

Distributed Computing in Sensor Systems

View full text Add to dashboard Cite

We consider a mobile sensor network monitoring a spatio-temporal field. Given limited cache sizes at the sensor nodes, the goal is to develop a distributed cache management algorithm to efficiently answer queries with a known probability distribution over the spatial dimension. First, we propose a novel distributed information theoretic approach in which the nodes locally update their caches based on full knowledge of the space-time distribution of the monitored phenomenon. At each time instant, local decisions are made at the mobile nodes concerning which samples to keep and whether or not a new sample should be acquired at the current location. These decisions account for minimizing an entropic utility function that captures the average amount of uncertainty in queries given the probability distribution of query locations. Second, we propose a different correlation-based technique, which only requires knowledge of the second-order statistics, thus relaxing the stringent constraint of having a priori knowledge of the query distribution, while significantly reducing the computational overhead. It is shown that the proposed approaches considerably improve the average field estimation error by maintaining efficient cache content. It is further shown that the correlation-based technique is robust to model mismatch in case of imperfect knowledge of the underlying generative correlation structure.

show abstract

Cooperative Caching in Ad Hoc Networks

Cited by 117 publications

References 18 publications

A novel caching scheme for improving Internet-based mobile ad hoc networks performance

A novel caching scheme for improving Internet-based mobile ad hoc networks performance

Achieving Flexible Cache Consistency for Pervasive Internet Access

An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors

Contact Info

Product

Resources

About