Collaborative Caching and Matching for D2D Content Sharing

Dan Wu, Liang Zhou, Yueming Cai, Yi Qian

Abstract: 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.