返回
Inter-Cluster Cooperation for Wireless D2D Caching Networks
DOI:10.1109/TWC.2018.2854603.png)
摘要
En 中文
Proactive wireless caching and device to device (D2D) communication have emerged as promising techniques for enhancing users' quality of service and network performance. In this paper, we propose a new architecture for D2D caching with inter-cluster cooperation. We study a cellular network in which users cache popular files and share them with other users either in their proximity via D2D communication or with remote users using cellular transmission. We characterize the network average delay per request from a queuing perspective. Specifically, we formulate the delay minimization problem and show that it is NP-hard. Furthermore, we prove that the delay minimization problem is equivalent to the minimization of a non-increasing monotone supermodular function subject to a uniform partition matroid constraint. A computationally efficient greedy algorithm is proposed which is proven to be locally optimal within a factor (1 - e(-1)) approximate to 0.63 of the optimum. We analyze the average per request throughput for different caching schemes and conduct the scaling analysis for the average sum throughput. We show how throughput scaling depends on video content popularity when the number of files grows asymptotically large. Simulation results show a delay reduction of 45% to 80% compared to a D2D caching system without inter-cluster cooperation.
Keyword:
D2D caching
queuing theory
delay analysis
scaling analysis
throughput analysis
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
Efficient Scheduling and Power Allocation for D2D-Assisted Wireless Caching NetworksD2D-Assisted无线缓存网络的高效调度和功率分配
Towards a consistent classification scheme for geochemical environments, or, why we wish the term ‘suboxic’ would go away
Geobiology
IF0

