Delay Analysis for Wireless D2D Caching with Inter-cluster Cooperation

TL;DR

This paper introduces a new architecture for D2D caching with inter-cluster cooperation in cellular networks, demonstrating significant delay reduction through a novel delay minimization approach and efficient algorithms.

Contribution

It proposes a new D2D caching architecture with inter-cluster cooperation and formulates a delay minimization problem, providing a greedy algorithm with provable near-optimal performance.

Findings

Over 45% delay reduction compared to non-cooperative systems

Delay minimization problem is NP-hard and equivalent to super modular function minimization

Proposed greedy algorithm achieves within a factor of 2 of optimal

Abstract

Proactive wireless caching and 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 minimization of a non-increasing monotone super modular function subject to a partition matroid constraint. A computationally efficient greedy algorithm is proposed which is proven to be locally optimal within a factor 2 of the optimum. Simulation results show more than 45% delay reduction compared to a D2D caching system without inter-cluster cooperation.