Cooperative RAN Caching Based on Local Altruistic Game for Single and Joint Transmissions

Hongjia Li, Chang Yang, Xueqing Huang, Nirwan Ansari, Zejue Wang

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


This letter proposes a cooperative caching placement framework for coordinated multi-point joint transmission and single cell transmission, to minimize content transmission time for mobile users. The optimization problem is NP-hard. We thus transform it into a local altruistic game, and propose two evolved Spatial Adaptive Play (SAP) algorithms: the first one overcomes the main limitation of the traditional SAP that large action sets pose an unsurmountable computational burden; the second one further expedites escape from convergence traps caused by fake Nash Equilibria. Numerical results conducted based on a real-world LTE traffic data set have validated the performance of our proposed algorithms.

Original languageEnglish (US)
Article number7769220
Pages (from-to)853-856
Number of pages4
JournalIEEE Communications Letters
Issue number4
StatePublished - Apr 2017

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering


  • 5G
  • NP-hard optimization
  • cooperative RAN caching
  • local altruistic game


Dive into the research topics of 'Cooperative RAN Caching Based on Local Altruistic Game for Single and Joint Transmissions'. Together they form a unique fingerprint.

Cite this