Learning-Based Delay-Aware Caching in Wireless D2D Caching Networks

TL;DR

This paper introduces a learning-based caching algorithm for wireless D2D networks that minimizes delay by adaptively learning file request patterns without prior knowledge, outperforming naive and probabilistic caching strategies.

Contribution

It proposes a novel delay-aware caching algorithm using non-parametric estimation to optimize cache placement in dynamic D2D cellular networks.

Findings

The algorithm significantly reduces transmission delay compared to naive caching.

It achieves higher throughput and adaptability in changing network conditions.

Numerical results confirm the algorithm's superiority over baseline methods.

Abstract

Recently, wireless caching techniques have been studied to satisfy lower delay requirements and offload traffic from peak periods. By storing parts of the popular files at the mobile users, users can locate some of their requested files in their own caches or the caches at their neighbors. In the latter case, when a user receives files from its neighbors, device-to-device(D2D) communication is performed. D2D communication underlaid with cellular networks is also a new paradigm for the upcoming wireless systems. By allowing a pair of adjacent D2D users to communicate directly, D2D communication can achieve higher throughput, better energy efficiency and lower traffic delay. In this work, we propose an efficient learning-based caching algorithm operating together with a non-parametric estimator to minimize the average transmission delay in D2D-enabled cellular networks. It is assumed that the system does not have any prior information regarding the popularity of the files, and the non-parametric estimator is aimed at learning the intensity function of the file requests. An algorithm is devised to determine the best <file,user> pairs that provide the best delay improvement in each loop to form a caching policy with very low transmission delay and high throughput. This algorithm is also extended to address a more general scenario, in which the distributions of fading coefficients and values of system parameters potentially change over time. Via numerical results, the superiority of the proposed algorithm is verified by comparing it with a naive algorithm, in which all users simply cache their favorite files, and by comparing with a probabilistic algorithm, in which the users cache a file with a probability that is proportional to its popularity.