Reproduce “Joint System Latency and Data Freshness Optimization for Cache-enabled Mobile Crowdsensing Networks” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Kexin Shi, Yaru Fu, Yongna Guo, Fu Lee Wang, Yan Zhang
This research develops a joint optimization framework for cache-enabled Mobile Crowdsensing (MCS) networks that minimizes a weighted sum of system latency and Age of Information (AoI). The proposed time-efficient algorithm integrates dynamic sensing decisions, user and subchannel allocation, and a Bayesian caching policy, outperforming baseline schemes by up to 96.56% in simulations.
Key insights
- Optimizing user and subchannel allocation for re-sensing tasks can be effectively modeled and solved as a maximum weighted matching problem using the Hungarian algorithm.
- A crucial decision point in cache-enabled mobile crowdsensing is the trade-off between re-sensing for freshness and reusing cached data for resource efficiency, which can be balanced by comparing weighted latency and Age of Information (AoI).
- Task allocation strategy, particularly non-uniform distribution, has a more pronounced impact on overall system performance than subchannel allocation in minimizing the weighted sum of delay and AoI.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.