A key based cache replacement policy for cooperative caching in mobile ad hoc networks

Joy, Preetha Theresa; Jacob, K. Poulose

doi:10.1109/iadcc.2013.6514255

Cited by 11 publications

(6 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Joy and Jacob [13] have proposed cache replacement algorithm for cooperative caching in ad hoc networks. This cache replacement algorithm greatly improves the effectiveness of the cache by selecting suitable subset of data for caching.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Link quality‐based cache replacement technique in mobile ad hoc network

Dhanapal

Srivatsa

2013

IET Information Security

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

“…In our previous work [13], we have proposed a multipath routing protocol for effective local route recovery , each source and destination pair establishes multiple paths in single route discovery and they are cached in their route caches. The cached routes are sorted on the basis of their bandwidth availability.…”

Section: Introductionmentioning

confidence: 99%

Link quality‐based cache replacement technique in mobile ad hoc network

Dhanapal

Srivatsa

2013

IET Information Security

View full text Add to dashboard Cite

“…A key based caching [16] and checking system is used which sends a message along with a key over the network to a destination that is entirely decided based on the key. The key is generated based on a random seed sent by a trusted initiator.…”

Section: Distributed Detection Protocolmentioning

confidence: 99%

Node clone detection using a stable overlay network

Chelliah

Vigil

Praba

2020

IJECE

View full text Add to dashboard Cite

Wireless sensor networks consist of number of sensor nodes widely distributed in particular region to communicate and sharing the environmental information and also these data’s are stored in central location for further data prediction. Such nodes are susceptible to cloning attack where the adversary captures a node, replicates with the same identity as that of the captured node and deploys the clone back into the network, causing severe harm to the network. Hence to thwart such attacks, a distributed detection protocol is used with initiator-observer-inspector roles assigned randomly for the nodes to witness the clone and thereby broadcast the evidence through a balanced overlay network. Use of such balanced network provides high security level and reduces the communication cost when compared to other overlay networks with a reasonably less storage consumption.

show abstract

“…Thus, a good replacement policy allows reducing general traffic by conserving cached data as long as possible. In order to ensure this, some replacement policies were previously proposed [15], [21]- [23]. They are classified following the parameters used to take the replacement decision.…”

Section: Related Work a Cooperative Cachingmentioning

confidence: 99%

Introducing a Data Sliding Mechanism for Cooperative Caching in Manycore Architectures

Dahmani

Cudennec

Gogniat

2013

2013 IEEE International Symposium on Parallel &Amp; Distributed Processing, Workshops and PHD Forum

View full text Add to dashboard Cite

In future micro-architectures, the increase of the number of cores and wire network complexity is leading to several performance degradation. These platforms are intended to process large amount of data. One of the biggest challenges for systems scalability is actually the memory wall: the memory latency is hardly increasing compared to technology expectations. Recent works explore potential software and hardware solutions mainly based on different caching schemes for addressing off-chip access issues.In this paper, we propose a new cooperative caching method improving the cache miss rate for manycore micro-architectures. The work is motivated by some limitations of recent adaptive cooperative caching proposals. Elastic Cooperative caching (ECC), is a dynamic memory partitioning mechanism that allows sharing cache across cooperative nodes according to the application behavior. However, it is mainly limited with cache eviction rate in case of highly stressed neighborhood. Another system, the adaptive Set-Granular Cooperative Caching (ASCC), is based on finer set-based mechanisms for a better adaptability. However, heavy localized cache loads are not efficiently managed. In such a context, we propose a cooperative caching strategy that consists in sliding data through closer neighbors. When a cache receives a storing request of a neighbor's private block, it spills the least recently used private data to a close neighbor. Thus, solicited saturated nodes slide local blocks to their respective neighbors to always provide free cache space. We also propose a new Prioritybased Data Replacement policy to decide efficiently which blocks should be spilled, and a new mechanism to choose host destination called Best Neighbor selector.The first analytic performance evaluation shows that the proposed cache management policies reduce by half the average global communication rate. As frequent accesses are focused in the neighboring zones, it efficiently improves on-Chip traffic.Finally, our evaluation shows that cache miss rate is enhanced: each tile keeps the most frequently accessed data 1-Hop close to it, instead of ejecting them Off-Chip. Proposed techniques notably reduce the cache miss rate in case of high solicitation of the cooperative zone, as it is shown in the performed experiments.

show abstract

A key based cache replacement policy for cooperative caching in mobile ad hoc networks

Cited by 11 publications

References 17 publications

Link quality‐based cache replacement technique in mobile ad hoc network

Link quality‐based cache replacement technique in mobile ad hoc network

Node clone detection using a stable overlay network

Introducing a Data Sliding Mechanism for Cooperative Caching in Manycore Architectures

Contact Info

Product

Resources

About