Low Rank Matrix Completion for Mobile Edge Caching in Fog RAN via Riemannian Optimization
The upcoming big data era requires tremendous computation and storage resources for communications. By pushing computation and storage to network edges, fog radio access networks (Fog RAN) can effectively increase network throughput and reduce transmission latency. Furthermore, we can exploit the benefits of cache enabled architecture in Fog RAN to deliver contents with less latency. Radio access units (RAUs) need content delivery from fog servers through wireline links whereas multiple mobile devices need contents from RAUs wirelessly. This work proposes a unified low rank matrix completion (LRMC) approach to solving the content delivery problem in both wireline and wireless parts of Fog RAN. To attain a low caching latency, we present a high precision approach with Riemannian trust region method to solve the challenging LRMC problem by exploiting the quotient manifold geometry of fixed rank matrices. Numerical results show that the new approach has a faster convergence rate, is able to achieve optimal results, and outperforms other state of art algorithms.
2016 IEEE Global Communications Conference (GLOBECOM)