Improved group-based cooperative caching scheme for mobile ad hoc networks

Ting, I-Wei; Chang, Yeim-Kuan

doi:10.1016/j.jpdc.2012.12.013

Cited by 27 publications

(24 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ting et al [16] purposed the Group-based Cooperative Caching (GCC) allows Mobile Nodes and their neighbors to form a group, and exchange a bitmap data directory periodically used for GCC scheme. GCC is based on the concept of group caching.…”

Section: Related Workmentioning

confidence: 99%

“…ZCC has tried to avoid the overhead of flooding based cache resolution. In Ting et al [16], cache placement based on remaining cache space within requested zone and number of hello messages, but in our scheme, we give the energy aware based cache placement, that is, depends on remaining cache and remaining energy level of mobile clients which available in the requested zone.…”

Section: Related Workmentioning

confidence: 99%

“…The simple weak consistency model based on the TTL, in which a client considers a cached copy of data item up-to-date if its TTL has not expired. The client removes the cached data item when the TTL expires to save cache space [13][14][15][16].…”

Section: //Assuming D R Is Replaced Data Itemmentioning

confidence: 99%

“…Also, in the battlefield, an officer in a car carries the server containing information about everything. The soldiers usually need to obtain information from the server to help determining the next action [16], so our simulation environment, server can be mobile. Sever can also move arbitrarily in the network at a speed of 4 m/s.…”

Section: Simulation Model and Environmentmentioning

confidence: 99%

“…A better cooperative caching is required to efficiently use the caches of all clients. Third, if the cache of an client shred by the large number of other clients, the cache space may become full or and the battery power of this client may be quickly drained [16].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Cooperative Caching Strategy in Mobile Ad Hoc Networks for Cache the Replaced Data Item

Jain

Sharma

2015

Wireless Pers Commun

View full text Add to dashboard Cite

In this paper, we present a scheme, called Zone-based Cooperative Caching (ZCC) for data caching in mobile ad hoc networks. In ZCC scheme, r-hop neighbors of a mobile clients form a cooperative cache zone. The objective is to improve data availability and access efficiency by collaborating local resources of mobile clients. ZCC addresses two basic problem of cooperative caching: cache resolution and cache management. In ZCC scheme, for a local cache miss, requested client looks for data item within its zone. If no client inside the zone has cached the requested data item, zone-based cache resolution process is invoked to find the cached client before reaching the server. In this scheme, for cache management, we proposed an optimistic placement for store the replace data item in requested zone. For optimistic placement, caching status and mobile client energy level status is exchanged and maintain periodically in a zone. Simulation with ns-2.32 software were used to study the performance of the system in terms of success ratio, miss ratio, average number of messages per request, and average travel distance in hops and to compare with the performance of No Cache, SimpleCache, Hop-by-Hop Cache resolution schemes. The results demonstrate the effectiveness of the proposed scheme in terms of achieved data availability and low delay for data retrieval.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: //Assuming D R Is Replaced Data Itemmentioning

confidence: 99%

Section: Simulation Model and Environmentmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Cooperative Caching Strategy in Mobile Ad Hoc Networks for Cache the Replaced Data Item

Jain

Sharma

2015

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

Replication enabled distributed cache invalidation method: replication enabled distributed cache management system for wireless mobile networks

Fawaz

Artail

Alkhansa

et al. 2013

Wireless Communications

View full text Add to dashboard Cite

This work proposes a replication scheme that is implemented on top of a previously proposed system for MANETs that cache submitted queries in special nodes, called query directories, and uses them to locate the data (responses) that are stored in the nodes that first request them, called caching nodes. The system, which was named distributed cache invalidation method (DCIM), includes client‐based mechanisms for keeping the cached data consistent with the data source. In this work, we extend DCIM to handle cache replicas inside the MANET. For this purpose, we utilize a push‐based approach within the MANET to propagate the server updates to replicas inside the network. The result is a hybrid approach that utilizes the benefits of pull approaches for client server communication and those of push approaches inside the network between the replicas. The approach is analyzed analytically, and the appropriate number of replicas is obtained, where it was concluded that full replication of the indices of data items at the query directory and two‐partial replication of the data items themselves makes most sense. Simulation results based on ns2 demonstrate the ability of the added replication scheme to lower delays and improve hit ration at the cost of mild increases in overhead traffic. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Caching algorithms for broadcasting and multicasting in disruption tolerant networks

Tian

Liu

Zhou

et al. 2016

Wireless Communications

View full text Add to dashboard Cite

In delay and disruption tolerant networks, the contacts among nodes are intermittent. Because of the importance of data access, providing efficient data access is the ultimate aim of analyzing and exploiting disruption tolerant networks. Caching is widely proved to be able to improve data access performance. In this paper, we consider caching schemes for broadcasting and multicasting to improve the performance of data access. First, we propose a caching algorithm for broadcasting, which selects the community central nodes as relays from both network structure perspective and social network perspective. Then, we accommodate the caching algorithm for multicasting by considering the data query pattern. Extensive trace-driven simulations are conducted to investigate the essential difference between the caching algorithms for broadcasting and multicasting and evaluate the performance of these algorithms. It has been widely proved that caching is a promising way to improve the performance of data access [9,10]. We can store certain data at some nodes to respond to the query. There have been some studies focusing on caching algorithms for web-based wired networks [11] and wireless ad hoc networks [10,[12][13][14]. Because of the lack of persistent network connectivity, these caching algorithms cannot be applied in DTNs directly [9]. In [15], Gao et al. proposed the caching algorithms for DTNs; however, they did not consider the difference between the caching algorithm for broadcasting and the caching algorithm for multicasting.

show abstract

Improved group-based cooperative caching scheme for mobile ad hoc networks

Cited by 27 publications

References 15 publications

Cooperative Caching Strategy in Mobile Ad Hoc Networks for Cache the Replaced Data Item

Cooperative Caching Strategy in Mobile Ad Hoc Networks for Cache the Replaced Data Item

Replication enabled distributed cache invalidation method: replication enabled distributed cache management system for wireless mobile networks

Caching algorithms for broadcasting and multicasting in disruption tolerant networks

Contact Info

Product

Resources

About