Cache Placement with Virtual Matching in Large-Scale Cache-Enabled Multicasting Wireless Networks

To solve the multi-dimensional resource allocation problem in the large-scale cache-enabled multicasting wireless networks, this paper proposes a multi-stage virtual matching game method. Specifically, the proposed method performs virtual grouping of mobile users (MUs) according to location distribution of MUs, the file request probabilities of MUs, and the coverage area of cache-enabled access points (CAPs). Moreover, by virtual grouping, the huge decision-making space has been significantly reduced. Then, we propose the multi-stage virtual matching game method, which is superior to the better response (BR) algorithm in computation of single iteration, convergence speed, and system utility function.