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.

Decentralized asynchronous coded caching design and performance analysis in fog radio access networks

Jiang, Yanxiang; Huang, Wenlong; Bennis, Mehdi; Zheng, Fu-Chun (2019-02-01)

 
Avaa tiedosto
nbnfi-fe2019120946288.pdf (7.159Mt)
nbnfi-fe2019120946288_meta.xml (30.85Kt)
nbnfi-fe2019120946288_solr.xml (36.25Kt)
Lataukset: 

URL:
https://doi.org/10.1109/TMC.2019.2896970

Jiang, Yanxiang
Huang, Wenlong
Bennis, Mehdi
Zheng, Fu-Chun
Institute of Electrical and Electronics Engineers
01.02.2019

Y. Jiang, W. Huang, M. Bennis and F. Zheng, "Decentralized Asynchronous Coded Caching Design and Performance Analysis in Fog Radio Access Networks," in IEEE Transactions on Mobile Computing, vol. 19, no. 3, pp. 540-551, 1 March 2020. doi: 10.1109/TMC.2019.2896970

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

Abstract

In this paper, we investigate the problem of asynchronous coded caching in fog radio access networks (F-RAN). To minimize the fronthaul load, the encoding set collapsing rule and encoding set partition method are proposed to establish the relationship between the coded-multicasting contents for asynchronous and synchronous coded caching. Furthermore, a decentralized asynchronous coded caching scheme is proposed, which provides asynchronous and synchronous transmission methods for different delay requirements. The closed-form expression of the fronthaul load is established for the special case where the number of requests during each time slot is fixed, and the upper and lower bounds of the fronthaul load are given for the general case where the number of requests during each time slot is random. The simulation results show that our proposed scheme can create considerable coded-multicasting opportunities in asynchronous request scenarios.

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