Decentralized Asynchronous Coded Caching in Fog-RAN
Wenlong Huang, Yanxiang Jiang, Mehdi Bennis, Fu-Chun Zheng, Haris, Gacanin, and Xiaohu You
TL;DR
This paper proposes a decentralized asynchronous coded caching scheme for fog radio access networks that reduces fronthaul load and enhances coded-multicasting opportunities under asynchronous request scenarios.
Contribution
It introduces encoding set collapsing and partition methods, along with a decentralized scheme offering both asynchronous and synchronous transmission options.
Findings
Significant reduction in fronthaul load.
Enhanced coded-multicasting opportunities.
Effective in asynchronous request scenarios.
Abstract
In this paper, we investigate asynchronous coded caching in fog radio access networks (F-RAN). To minimize the fronthaul load, the encoding set collapsing rule and encoding set partition method are proposed to establish the relationship between the coded-multicasting contents in asynchronous and synchronous coded caching. Furthermore, a decentralized asynchronous coded caching scheme is proposed, which provides asynchronous and synchronous transmission methods for different delay requirements. The simulation results show that our proposed scheme creates considerable coded-multicasting opportunities in asynchronous request scenarios.
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
TopicsCaching and Content Delivery · Cooperative Communication and Network Coding · Opportunistic and Delay-Tolerant Networks