COLLABORATIVE CACHING AND MATCHING FOR D2D CONTENT SHARING

作     者：Wu, Dan Zhou, Liang Cai, Yueming Qian, Yi 

作者机构：Army Engn Univ Zhengzhou Henan Peoples R China Nanjing Univ Posts & Telecommun Nanjing Jiangsu Peoples R China Univ Nebraska Dept Elect & Comp Engn Lincoln NE USA 

出 版 物：《IEEE WIRELESS COMMUNICATIONS》 (IEEE Wirel. Commun.)

年 卷 期：2018年第25卷第3期

页      面：43-49页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Natural Science Foundation of China [61671474, 61571240] Jiangsu Provincial Natural Science Foundation [BK20170089] 

主　　题：Device-to-device communication Collaboration Receivers Interference 5G mobile communication Internet Distributed algorithms 

摘      要：D2D content sharing is recognized as an effective response to the prevalence of multimedia and local services, especially for 5G edge networks. We construct a content sharing framework based on cache-assisted D2D communications, which consists of the content placement and delivery phases. When considering the random content location and the limited storage and transmission capability of devices, which content should be cached and how to optimally match potential providers to requesters of contents are of importance. As such, we extend the concept of cacheability, and accordingly propose a distributed collaborative cache management scheme. It involves a caching decision and update model based on the submodularity over matroid constraints, and a best effort distributed algorithm framework. Moreover, we extend the sharing mode category, and propose the sharing mode selection scheme by constructing a general social welfare maximization with efficient incentive mechanisms. By leveraging the total unimodularity, it can be simplified to its linear relaxation without loss of optimization.