Caching AP Selection and Channel Allocation in Wireless Caching Networks: A Binary Concurrent Interference Minimizing Game Solution

Caching in wireless networks can alleviate redundant data transmissions and can assist cell base stations in providing service. In this paper, we focus on the problem of joint caching access point (AP) selection and channel allocation for mobile users (MUs) in wireless caching networks. Considering MUs' dynamic probabilistic content demands, an asymmetric weighted interference graph is proposed to analyze the asymmetric interference among MU and caching AP pairs. We formulate the joint caching AP selection and channel allocation as a nonlinear optimization problem and then present a binary concurrent interference minimizing game theoretical scheme, where MUs and caching APs are two kinds of players with different kinds of actions and utilities. Unlike existing hierarchical game approaches, MUs and caching APs act concurrently without hierarchical constraints. Then, a novel pure strategy binary Nash equilibrium (BNE) and a concurrent binary better reply algorithm are proposed for the above game. It is proved that at least one BNE exists and the reply algorithm converges to a BNE. Moreover, simulation results show that the proposed approach can mitigate interference effectively and achieve a lower global interference level than the traditional better reply algorithm.