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 n...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on vehicular technology Vol. 70; no. 11; pp. 12248 - 12252
Main Authors Fang, Tao, Wu, Dan, Chen, Jiaxin, Sun, Youming
Format Journal Article
LanguageEnglish
Published New York IEEE 01.11.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Caching
content delivery
Cooperation
Device-to-device communication
Edge caching
Game theory
Games
Graph theory
Graphs
hypergraph theory
Nash equilibrium
potential game
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2021.3112274