Content Delivery in Edge Caching Networks: A Hypergraph Game-Theoretic Approach.

In this paper, we investigate the content delivery in edge caching networks where requesters can get the interested contents from surrounding helpers by device-to-device (D2D) communications. Taking the finite service capacity and cache space of helpers into account, the problem is to maximize the number of requesters obtaining all desired contents by optimizing the selection of content sources. The hypergraph theory is first applied to analyze the cumulative content effect caused by multiple content sources, and the problem is formulated as a hypergraph based cooperation cache game with at least one pure Nash equilibrium (NE). The log-linear based cooperation caching algorithm (LBCC) is proposed to find the corresponding NE points. Simulation results verify the superiority of the proposed LBCC. [ABSTRACT FROM AUTHOR]