We address the use of linear random fountain code caching schemes in a heterogeneous satellite network. We consider a system composed of multiple hubs and a geostationary Earth orbit satellite. Coded content is memorized in hubs' caches in order to serve immediately the user requests and reduce the usage of the satellite backhaul link. We derive the analytical expression of the average backhaul rate, as well as a tight upper bound to it with a simple expression. Furthermore, we derive the optimal caching strategy which minimizes the average backhaul rate and compare the performance of the linear random fountain code scheme to that of a scheme using maximum distance separable codes. Our simulation results indicate that the performance obtained using fountain codes is similar to that of maximum distance separable codes.

Small cells will play an important role in the fifth generation mobile networks. As recent works pointed out, a significant improvement in energy efficiency can be obtained if small base stations (SBSs) are provided with storage capabilities. In this paper, we study the problem of caching optimization in the presence of interference with and without cooperation between the SBSs. We consider a setup in which two SBSs and one macro base station (MBS) are connected through a wireless backhaul link. Cooperation is applied following the Han-Kobayashi rate splitting approach and its variation including common information. Our results show that applying cooperation to caching systems yields significant gains in terms of power and provide indications on how much interference can be tolerated which, in turn, has impact on the network design both in terms of frequency reuse planning and SBS deployment.

Caching multimedia contents at the network edge is a key solution to decongest the amount of traffic in the backhaul link. In this paper, we extend and analyze the coded caching technique [1] in an unexplored scenario, i.e. at the edge of twotier heterogeneous networks with an arbitrary number of users. We characterize the performance of such scheme by deriving a closed-form expression of the average backhaul load and reveal a significant gain compared to other benchmark caching schemes proposed in the literature.

Caching at the edge of wireless networks is a key technology to reduce traffic in the backhaul link. However, a concentrated amount of requests during peak-periods may cause the outage of the system, meaning that the network is not able to serve the whole set of demands. The outage probability is a fundamental metric to take into account during the network design. In this paper, we derive the analytical expression of the outage probability as a function of the total amount of users requests, library size, requests distribution, cache size and capacity constraints on the backhaul resources. In particular, we focus on a scenario where end-users have no direct connection to the master node which holds the complete library of content that can be requested. A general formulation of the outage is derived and studied for two relevant caching schemes, i.e. the random caching scheme and the most popular caching schemes. The exact closed form expressions presented in this paper provide useful insights on how requests, memory and resources can be balanced when the parameters of a cache-enabled network have to designed.

We study the performance of caching schemes based on LT under peeling (iterative) decoding algorithm. We assume that users ask for downloading content to multiple cache-aided transmitters. Transmitters are connected through a backhaul link to a master node while no direct link exists between users and the master node. Each content is fragmented and coded with LT code. Cache placement at each transmitter is optimized such that transmissions over the backhaul link is minimized. We derive a closed form expression for the calculation of the backhaul transmission rate. We compare the performance of a caching scheme based on LT with respect to a caching scheme based on maximum distance separable codes . Finally, we show that caching with LT codes behave as good as caching with maximum distance separable codes.