R. Amer, M. M. Butt, M. Bennis and N. Marchetti, "Inter-Cluster Cooperation for Wireless D2D Caching Networks," in IEEE Transactions on Wireless Communications, vol. 17, no. 9, pp. 6108-6121, Sept. 2018. doi: 10.1109/TWC.2018.2854603
Inter-cluster cooperation for wireless D2D caching networks
|Author:||Amer, Ramy1; Butt, M. Majid2; Bennis, Mehdi3,4;|
1Trinity College Dublin, University of Dublin, College Green, Dublin 2, Ireland
2CONNECT Center of Future Networks, Trinity College, University of Dublin, Dublin 2, Ireland
3University of Oulu, 90570 Oulu, Finland
4Department of Computer Engineering, Kyung Hee University, Yongin 446-701, South Korea
|Online Access:||PDF Full Text (PDF, 2.7 MB)|
|Persistent link:|| http://urn.fi/urn:nbn:fi-fe2018103039061
Institute of Electrical and Electronics Engineers,
|Publish Date:|| 2018-10-30
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⁻¹) ≈ 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.
IEEE transactions on wireless communications
|Pages:||6108 - 6121|
|Type of Publication:||
A1 Journal article – refereed
|Field of Science:||
213 Electronic, automation and communications engineering, electronics
This work was supported by the Science Foundation Ireland through the European Regional Development Fund under Grant 13/RC/2077.
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.