.png){kind=icon}
返回
COLLABORATIVE CACHING AND MATCHING FOR D2D CONTENT SHARING
.png){kind=icon}
PRE
AI
DOI：10.1109/MWC.2018.1700325.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
DELIVERY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.5
论文数:
2.8K
被引数:
1.3W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏
查看更多内容