AWARE: Evaluating PriorityFresh Caching for Offline Emergency Warning Systems
Charles Melvin, N. Rich Nguyen
TL;DR
This paper introduces PriorityFresh, a caching policy for offline emergency warning systems that enhances alert actionability without sacrificing efficiency, validated through simulation experiments.
Contribution
The paper presents PriorityFresh, a novel semantic caching policy tailored for offline emergency alerts, and demonstrates its effectiveness in simulation environments.
Findings
Improved alert actionability in simulations
Maintained efficiency with PriorityFresh caching
Validated with realistic alert sequences
Abstract
PriorityFresh is a semantic, actionability-first caching policy designed for offline emergency warning systems. Within the AWARE system's simulation environment, PriorityFresh optimizes which alerts to retain and surface under constrained connectivity. Experiments indicate improved actionability-first performance without harming efficiency. A separate Priority Forecasting model is used only to synthesize realistic alert sequences for controlled experiments and does not influence caching or push decisions.
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
TopicsOpportunistic and Delay-Tolerant Networks · Vehicular Ad Hoc Networks (VANETs) · Mobile Ad Hoc Networks