Hyppää sisältöön
    • FI
    • ENG
  • FI
  • /
  • EN
OuluREPO – Oulun yliopiston julkaisuarkisto / University of Oulu repository
Näytä viite 
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

Inter-cluster cooperation for wireless D2D caching networks

Amer, Ramy; Butt, M. Majid; Bennis, Mehdi; Marchetti, Nicola (2018-07-17)

 
Avaa tiedosto
nbnfi-fe2018103039061.pdf (2.701Mt)
nbnfi-fe2018103039061_meta.xml (30.23Kt)
nbnfi-fe2018103039061_solr.xml (34.42Kt)
Lataukset: 

URL:
https://doi.org/10.1109/TWC.2018.2854603

Amer, Ramy
Butt, M. Majid
Bennis, Mehdi
Marchetti, Nicola
Institute of Electrical and Electronics Engineers
17.07.2018

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

https://rightsstatements.org/vocab/InC/1.0/
© 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.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/TWC.2018.2854603
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2018103039061
Tiivistelmä

Abstract

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.

Kokoelmat
  • Avoin saatavuus [38865]
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen
 

Selaa kokoelmaa

NimekkeetTekijätJulkaisuajatAsiasanatUusimmatSivukartta

Omat tiedot

Kirjaudu sisäänRekisteröidy
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen