Recommendation-Enabled Edge Caching and D2D Offloading via Incentive-Driven Deep Reinforcement Learning

被引:2
作者
Wu, Tong [1 ]
Yu, Dongjin [1 ]
Liu, Chengfei [2 ]
Wang, Dongjing [1 ]
Huang, Binbin [1 ]
机构
[1] Hangzhou Dianzi Univ, Coll Comp Sci & Technol, Hangzhou 310018, Peoples R China
[2] Swinburne Univ Technol, Dept Comp Technol, Melbourne, Vic 3122, Australia
基金
中国国家自然科学基金;
关键词
Device-to-device communication; Costs; Prediction algorithms; Predictive models; Reinforcement learning; Sparse matrices; Quality of experience; Device-to-Device; edge caching; incentive mechanism; recommendation; reinforcement learning;
D O I
10.1109/TSC.2024.3351219
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article proposes a novel architecture of Recommendation-Enabled Edge Caching and Device-to-Device (D2D) Offloading via Incentive-driven Deep Reinforcement Learning (DRL), which can not only solve the problem of inaccurate recommendation caused by sparse rating matrix, but also encourage users to participate in D2D offloading through an effective incentive mechanism. Specifically, we define Pseudo Markov Decision Process (PMDP) for the first time, which enables the conversion of the non-sequential process (e.g. rating prediction) into a sequential one, making it suitable for DRL. Then, combining Supervised Learning (SL) and DRL, a Supervised DRL for Collaborative Filtering (CF) algorithm, named SDRLCF, is proposed to predict missing ratings. After that, from the perspective of Content Service Center (CSC), the incentive-driven recommendation-enabled edge caching and D2D offloading can be formulated as a Non-Linear Integer Programming (NLIP) problem, which belongs to NP-hard, and is difficult to obtain the optimal solution in polynomial time. To address this issue, a DRL based Edge Caching and Recommendation algorithm, named DRLECR, is proposed to minimize the cost of CSC. Finally, combining with economic theory, a Reverse Auction based Payment Determination algorithm under Vickrey-Clarke-Groves (VCG) scheme, named RAPD, is proposed, which can stimulate users to participate in edge caching and D2D offloading while guaranteeing the individual rationality and truthfulness of participants. Extensive experiment results on both realistic and synthetic datasets demonstrate that the proposed algorithms outperform other baseline methods under different scenarios.
引用
收藏
页码:1724 / 1738
页数:15
相关论文
共 45 条
[1]  
[Anonymous], 2019, Rep.
[2]  
Azizi V., 2022, P IEEE INT C BIG DAT, P2175
[3]   Jointly Optimizing Content Caching and Recommendations in Small Cell Networks [J].
Chatzieleftheriou, Livia Elena ;
Karaliopoulos, Merkouris ;
Koutsopoulos, Iordanis .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2019, 18 (01) :125-138
[4]   An Efficient Incentive Mechanism for Device-to-Device Multicast Communication in Cellular Networks [J].
Chen, Yichao ;
He, Shibo ;
Hou, Fen ;
Shi, Zhiguo ;
Chen, Jiming .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (12) :7922-7935
[5]  
Deng ZH, 2019, AAAI CONF ARTIF INTE, P61
[6]  
Ericsson, 2019, Ericsson Mobility Report June 2019 Edition. Retrieved October 15
[7]   Revenue Maximization: The Interplay Between Personalized Bundle Recommendation and Wireless Content Caching [J].
Fu, Yaru ;
Zhang, Yue ;
Wong, Angus K. Y. ;
Quek, Tony Q. S. .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2023, 22 (07) :4253-4265
[8]   Joint Content Caching, Recommendation, and Transmission Optimization for Next Generation Multiple Access Networks [J].
Fu, Yaru ;
Zhang, Yue ;
Zhu, Qi ;
Chen, Mingzhe ;
Quek, Tony Q. S. .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2022, 40 (05) :1600-1614
[9]   Caching Efficiency Maximization for Device-to-Device Communication Networks: A Recommend to Cache Approach [J].
Fu, Yaru ;
Salaun, Lou ;
Yang, Xiaolong ;
Wen, Wanli ;
Quek, Tony Q. S. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2021, 20 (10) :6580-6594
[10]   Context-Aware QoS Prediction With Neural Collaborative Filtering for Internet-of-Things Services [J].
Gao, Honghao ;
Xu, Yueshen ;
Yin, Yuyu ;
Zhang, Weipeng ;
Li, Rui ;
Wang, Xinheng .
IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (05) :4532-4542