Complete Interference Mitigation Through Receiver-Caching in Wyner's Networks
Mich\`ele Wigger, Roy Timo, and Shlomo Shamai (Shitz)

TL;DR
This paper establishes bounds on the per-user multiplexing gain in Wyner's networks with receiver caches, showing that large caches can fully eliminate interference, matching the performance of interference-free links.
Contribution
It provides tight bounds on multiplexing gain in Wyner's models with receiver caching, demonstrating complete interference mitigation with sufficiently large cache memories.
Findings
Per-user multiplexing gain is 1 + μ/D with large caches.
Receiver caches can fully mitigate interference in Wyner's networks.
Bounds are tight for specific cache memory thresholds.
Abstract
We present upper and lower bounds on the per-user multiplexing gain (MG) of Wyner's circular soft-handoff model and Wyner's circular full model with cognitive transmitters and receivers with cache memories. The bounds are tight for cache memories with prelog in the soft-handoff model and for in the full model, where denotes the number of possibly demanded files. In these cases the per-user MG of the two models is , the same as for non-interfering point-to-point links with caches at the receivers. Large receiver cache-memories thus allow to completely mitigate interference in these networks.
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.
