Cache Discovery Policies of MANET
Amer O. Abu Salem, Tareq Alhmiedat, Ghassan Samara

TL;DR
This paper reviews cache discovery algorithms in MANETs, proposing a cluster-based architecture with data cluster head election to improve data access efficiency and reduce flooding costs.
Contribution
It introduces a cluster architecture with data cluster head election and suggests alternative cache discovery techniques for MANETs.
Findings
Proposed cluster architecture with data cluster head election
Reviewed existing cache discovery algorithms and their stages
Discussed future research directions in cache discovery
Abstract
In situations where establishing a network infrastructure is impossible, Ad-hoc networks are considered particularly important. Most of the previous research in Ad-hoc networks concentrated on the development and enhancement of dynamic routing protocols, which could efficiently discover routes between two communicating nodes. Although routing strategies is an important topic in MANETs, other topics such as data access are also crucial since the final goal of using Ad-hoc networks is to provide data access to mobile nodes. One of the most attractive techniques used to improve the data access performance in MANET environment is cooperative caching; which means multiple caching nodes share and cooperatively manage the cached contents. It is lead the research to important questions, what data should be cached, where, when, and how? A cooperative caching addressed into two basic issues:…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks · Vehicular Ad Hoc Networks (VANETs)
