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.
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
- NP-hard optimization
- cooperative RAN caching
- local altruistic game