Mean-field game theoretic edge caching in ultra-dense networks

Hyesung Kim, Jihong Park, Mehdi Bennis, Seong Lyun Kim, Merouane Debbah

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)


This paper investigates a cellular edge caching problem under a very large number of small base stations (SBSs) and users. In this ultra-dense edge caching network (UDCN), conventional caching algorithms are inapplicable as their computational complexity increases with the number of small base stations (SBSs). Furthermore, the performance of UDCN is highly sensitive to the dynamics of user demand. To overcome such difficulties, we propose a distributed caching algorithm under a stochastic geometric network model, as well as a spatio-temporal user demand model that characterizes the content popularity dynamics. By leveraging mean-field game (MFG) theory, the complexity of the proposed UDCN caching algorithm becomes independent of the number of SBSs. Numerical evaluations validate this consistent complexity of the proposed algorithm with respect to the number of SBSs. Also, it shows that the proposed caching algorithm reduces not only the long run average cost of the network but also the redundant cached data respectively by 24% and 42%, compared to a baseline caching algorithm. Additionally, the simulation results show that the proposed caching algorithm is robust to imperfect popularity information while ensuring a low computational complexity.

Original languageEnglish
Article number8896875
Pages (from-to)935-947
Number of pages13
JournalIEEE Transactions on Vehicular Technology
Issue number1
Publication statusPublished - 2020 Jan

Bibliographical note

Publisher Copyright:
© 1967-2012 IEEE.

All Science Journal Classification (ASJC) codes

  • Automotive Engineering
  • Aerospace Engineering
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Mean-field game theoretic edge caching in ultra-dense networks'. Together they form a unique fingerprint.

Cite this