期刊
IEEE TRANSACTIONS ON SERVICES COMPUTING
卷 16, 期 4, 页码 2727-2741出版社
IEEE COMPUTER SOC
DOI: 10.1109/TSC.2023.3247611
关键词
Device-to-device communication; Costs; Recommender systems; Prediction algorithms; Correlation; Sparse matrices; Reinforcement learning; Broad learning; content caching; D2D Offloading; recommendation; reinforcement learning
Edge caching has become a hot research topic in Mobile Edge Computing (MEC) as an effective way to reduce traffic burden in cellular networks. By placing contents at the edge and utilizing Device-to-Device (D2D) links, caching and recommendation can improve efficiency and reduce transmission cost in edge caching. This article proposes a Joint Content Caching and Recommender System (JCCRS) that uses a Collaborative Filtering algorithm and a Deep Deterministic Policy Gradient (DDPG) based method to solve the content caching and recommendation problem.
Edge caching has been a research hotspot of the Mobile Edge Computing (MEC) in recent years, which is an effective way to ease the burden of traffic in cellular networks. It places contents to the edge of the networks and assists contents transmission via Device-to-Device (D2D) links. Traditional caching strategies strictly depend on the personal preferences of users, and they are scarcely possible to reduce the transmission cost while ensuring the high effectiveness. Fortunately, recent studies have found that the combination of caching and recommendation can effectively improve the efficiency of edge caching and reduce the transmission cost. In this article, we jointly consider the content caching and recommendation through Opportunistic Mobile Networks (OMNs) to reduce the cost of Content Service Center (CSC). In order to obtain the optimal caching and recommendation solutions with sparse rating matrix, we propose a Joint Content Caching and Recommender System (JCCRS). In JCCRS, a Broad Incremental Learning based Collaborative Filtering algorithm, named BILCF, is first proposed to predict the missing ratings. Afterwards, we quantify the relationship between each pair of Mobile Users (MUs) according to their mobility, similarity and preference. The content caching and recommendation problem is then modeled as a Non-Linear Integer Programming (NLIP) problem and we prove that it belongs to NP-hard. To solve this problem, a Deep Deterministic Policy Gradient (DDPG) based Content Caching and Recommendation method, named DCRM, is further proposed to obtain the approximate optimal solutions. Extensive experiments on both a realistic dataset and a synthetic dataset validated by the realistic data show that the proposed algorithms outperform other baseline methods under different scenarios.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据