Inter-cluster Cooperation for Wireless D2D Caching Networks
Ramy Amer, M. Majid Butt, Mehdi Bennis, and Nicola Marchetti

TL;DR
This paper introduces a novel inter-cluster cooperation architecture for D2D caching networks, optimizing delay and throughput, and demonstrating significant performance improvements through theoretical analysis and simulations.
Contribution
It models and optimizes inter-cluster D2D caching with a new delay minimization framework and proposes an efficient greedy algorithm with proven near-optimality.
Findings
Delay reduction of 45% to 80% with inter-cluster cooperation.
Delay minimization problem is NP-hard and equivalent to supermodular function minimization.
Throughput scaling depends on content popularity as the number of files grows.
Abstract
Proactive wireless caching and device to device (D2D) communication have emerged as promising techniques for enhancing users' quality of service and network performance. In this paper, we propose a new architecture for D2D caching with inter-cluster cooperation. We study a cellular network in which users cache popular files and share them with other users either in their proximity via D2D communication or with remote users using cellular transmission. We characterize the network average delay per request from a queuing perspective. Specifically, we formulate the delay minimization problem and show that it is NP-hard. Furthermore, we prove that the delay minimization problem is equivalent to the minimization of a non-increasing monotone supermodular function subject to a uniform partition matroid constraint. A computationally efficient greedy algorithm is proposed which is proven to be…
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.
