Skip to content
Open access

Proactive caching in cloud and D2D assisted multi-tier cellular networks

Aug 2026 · PeerJ Computer Science · Vol 12, pp. e4004 · 0 citations · 64 references

TL;DR

Numerical simulations demonstrate that proactive caching based on clustered-BSVM outperforms existing methods in terms of CHR and USR, while the branch-and-bound method effectively resolves the content delivery problem, minimizing system latency.

Abstract

Proactive caching in multi-tier cellular networks (MTCNs) is an efficient technique for alleviating heavy data traffic on backhaul links, thereby reducing content latency and increasing the overall cache hit ratio (CHR) and user satisfaction ratio (USR). The CHR and USR can be further enhanced by incorporating cache-enabled device-to-device (D2D) and cloud cache into MTCNs, forming cloud and D2D-assisted multi-tier cellular networks (CD2DMTCNs). In this context, we formulate two problems: the first is the joint optimization of the overall CHR and USR of the system, while the second focuses on minimizing the average content latency. The popularity prediction of newly published content using machine learning algorithms has become increasingly attractive, with support vector machines (SVMs) showing promising results in this regard. However, for improved performance, an uncertainty assessment is necessary. To address this, bootstrapping is applied to SVM to obtain confidence and prediction intervals. Additionally, K-means clustering is used to form virtual clusters within both D2D networks and MTCNs, facilitating content popularity prediction. This enables the maximization of CHR and USR through a clustered-bootstrapped support vector machine (clustered-BSVM). In addition, establishing criteria for content delivery is essential. Since multiple cache-enabled transmitters may store the content requested by users, only one transmitter can deliver the requested content at a time. This constraint is addressed using the branch-and-bound method of linear programming, which minimizes the average latency of the system. Numerical simulations demonstrate that proactive caching based on clustered-BSVM outperforms existing methods in terms of CHR and USR, while the branch-and-bound method effectively resolves the content delivery problem, minimizing system latency.

Read PDF

Similar papers

Conference Jul 2026

An Intelligent Content Caching for NDN with Communication-Efficient State Sharing

The built-in caching capability of Named Data Networking (NDN) is one of the most transformative proposals of next-generation network architecture, as it simultaneously realizes network traffic reduction, resilience to node failures, and prompt data retrieval. However, existing caching policies either make too many cac...

Deep Pradipbhai Shah, Sai Sameer Yanamandra, Siva Girish Ramesh et al. · 0 citations
2026

Traffic Prediction-Assisted Resource Allocation for RAN Slicing Enabling URLLC and eMBB Coexistence

The coexistence of Ultra-Reliable Low-Latency Communication (URLLC) and Enhanced Mobile Broadband (eMBB) can simultaneously meet the reliability and real-time performance requirements of critical services as well as the requirements of high-bandwidth services. In 5G and beyond 5G (B5G) networks, radio access network (R...

Yixuan Bai, Heng Wang · 0 citations
Open access 2026

Enhancement of Cooperative NOMA Performance via Integration withm-MIMO and Caching

The results demonstrated that integrating C-NOMA with caching and m-MIMO leads to better performance in sum rate, latency reduction, and throughput for different file sizes, different networks traffic, different users and stations numbers and different power allocation levels.

S. Ahmed, S. Ameen · 0 citations
Open access Aug 2026

Energy-Efficient Cooperative Data Offloading in Cellular Networks Using Reinforcement Learning

This research is among the first to employ MARL to this extent, and it offers an end-to-end solution that combines cellular, Wi-Fi, and device-to-device (D2D) communications and considers practical network environments like user mobility and channel conditions.

Nabeel Abdolrazagh Yaseen Alrashedi, Rasool Sadeghi, Wael Hussein Zayer Al-Lamy et al. · 0 citations
Open access Sep 2026

Dynamic Scheduling Algorithm for Edge-cloud Collaborative Computing Resources Based on 5G NR-U and Distributed Large Model

With the deployment of 5G NR-U (5th Generation New Radio in Unlicensed Spectrum) in unlicensed spectrum and the rise of sparse large-scale models (exemplified by Switch Transformers) in edge computing, edge-cloud collaborative training faces the dual challenges of dynamic spectrum contention and heterogeneous load...

De-Feng Duan, Hong Liu, Li-Yun Huang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.