Network coding-based caching in large-scale SIC-enabled wireless networks

Network coding-based caching at base stations (BSs) is a promising caching approach to support massive content delivery over wireless networks. However, existing network coding-based caching designs do not fully explore and exploit the potential advantages. In this paper, we consider the analysis and optimization of a random linear network coding-based caching design in large-scale successive interference cancellation (SIC)-enabled wireless networks. By utilizing tools from stochastic geometry, we derive a tractable expression for the successful transmission probability in the general file size regime. To further obtain design insights, we also derive closed-form expressions for the successful transmission probability in the small and large file size regimes, respectively. Then, we consider the successful transmission probability maximization by optimizing a design parameter, which is a complex discrete optimization problem. We propose a two-stage optimization framework and obtain a near optimal solution with superior performance and manageable complexity. The analysis and optimization results provide valuable design insights for practical cache and SIC enabled wireless networks. Finally, by numerical results, we show that the proposed near optimal caching design achieves a significant performance gain over some baseline caching designs.