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.

Delay analysis for wireless D2D caching with inter-cluster cooperation

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

 
Avaa tiedosto
nbnfi-fe2018080133218.pdf (265.3Kt)
nbnfi-fe2018080133218_meta.xml (30.31Kt)
nbnfi-fe2018080133218_solr.xml (32.00Kt)
Lataukset: 

URL:
https://doi.org/10.1109/GLOCOM.2017.8254693

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

R. Amer, M. M. Butt, M. Bennis and N. Marchetti, "Delay Analysis for Wireless D2D Caching with Inter-Cluster Cooperation," GLOBECOM 2017 - 2017 IEEE Global Communications Conference, Singapore, 2017, pp. 1-7. doi: 10.1109/GLOCOM.2017.8254693

https://rightsstatements.org/vocab/InC/1.0/
© 2017 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/GLOCOM.2017.8254693
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2018080133218
Tiivistelmä

Abstract

Proactive wireless caching and 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 minimization of a non-increasing monotone supermodular function subject to a partition matroid constraint. A computationally efficient greedy algorithm is proposed which is proven to be locally optimal within a factor 2 of the optimum. Simulation results show more than 45% delay reduction compared to a D2D caching system without inter-cluster cooperation. Index Terms-D2D caching, queuing analysis, delay analysis.

Kokoelmat
  • Avoin saatavuus [38588]
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