A Caching Strategy Based on Many-to-Many Matching Game in D2D Networks

作     者：Kaihang Yu Zhonggui Ma Runyu Ni Tao Zhang Kaihang Yu;Zhonggui Ma;Runyu Ni;Tao Zhang

作者机构：School of Computer and Communication EngineeringUniversity of Science and Technology BeijingBeijing 100083China Key Lab of Information Network SecurityMinistry of Public SecurityShanghai 201204China 

出 版 物：《Tsinghua Science and Technology》 (清华大学学报（自然科学版（英文版）)

年 卷 期：2021年第26卷第6期

页      面：857-868页

核心收录：

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 

基　　金：supported by the Fundamental Research Funds for the Central Universities (Nos.FRF-DF-20-12 and FRF-GF-18-017B) 

主　　题：caching strategy Device-to-Device(D2D)networks Gauss determinantal point process many-to-many matching game 

摘      要：Wireless edge caching has been proposed to reduce data traffic congestion in backhaul links, and it is being envisioned as one of the key components of next-generation wireless networks. This paper focuses on the influences of different caching strategies in Device-to-Device(D2D) networks. We model the D2D User Equipments(DUEs) as the Gauss determinantal point process considering the repulsion between DUEs, as well as the caching replacement process as a many-to-many matching game. By analyzing existing caching placement strategies, a new caching strategy is proposed, which represents the preference list of DUEs as the ratio of content popularity to cached probability. There are two distinct features in the proposed caching strategy.(1) It can cache other contents besides high popularity contents.(2) It can improve the cache hit ratio and reduce the latency compared with three caching placement strategies: Least Recently Used(LRU), Equal Probability Random Cache(EPRC), and the Most Popular Content Cache(MPC). Meanwhile, we analyze the effect of caching on the system performance in terms of different content popularity factors and cache capacity. Simulation results show that our proposed caching strategy is superior to the three other comparison strategies and can significantly improve the cache hit ratio and reduce the latency.