Optimal Geographic Caching in Cellular Networks with Linear Content Coding

Understand

We state and solve a problem of the optimal geographic caching of content in cellular networks, where linear combinations of contents are stored in the caches of base stations.

• We consider a general content popularity distribution and a general distribution of the number of stations covering the typical location in the network.
• We are looking for a policy of content caching maximizing the probability of serving the typical content request from the caches of covering stations.
• The problem has a special form of monotone sub-modular set function maximization.