TY - JOUR
T1 - Enhancing Content Caching in D2D Networks
T2 - A Stackelberg Game Approach with Wireless Energy Transfer and Social Awareness
AU - Chan, Yu Wei
AU - Shih, Chung Ming
AU - Chien, Feng Tsun
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2025
Y1 - 2025
N2 - In a cache-enabled device-to-device (D2D) network, cooperative D2D caching holds promise for reducing data traffic and overall waiting time. However, the act of content caching and transmission can impose a drain on battery power, thereby diminishing users' enthusiasm. In this study, we examine a D2D group wherein all D2D transmitters (D2D-TXs) collaborate to serve users alongside the utilization of wireless power transfer for charging D2D-TXs. We consolidate the cache capacities of all D2D-TXs into a single entity and formulate a unified caching policy. Additionally, we design an incentive power mechanism aimed at users with social consciousness to incentivize D2D-TXs. To meet users' quality of service (QoS) requirements, we employ the Poisson point process and a hexagonal grid model to assess the likelihood of successful content delivery from base stations (BSs) and D2D-TXs to a user situated at the center of the D2D group. Addressing users' waiting time constraints, we evaluate the cumulative waiting time using inter-contact and G/G/1 queueing models. A Stackelberg game framework is employed to resolve conflict between D2D-TXs and users. The objective is to achieve a Stackelberg equilibrium, wherein users minimize costs by establishing an incentive power benchmark based on their QoS, while D2D-TXs maximize utility through optimized content caching strategies. Simulation results demonstrate that cooperative caching, with equitable distribution of cached contents among D2D-TXs, yields lower total waiting time than non-cooperative caching. Furthermore, as user density, total cache size, and data skewness increase, our proposed caching scheme exhibits minimal total waiting time for D2D-TXs and users.
AB - In a cache-enabled device-to-device (D2D) network, cooperative D2D caching holds promise for reducing data traffic and overall waiting time. However, the act of content caching and transmission can impose a drain on battery power, thereby diminishing users' enthusiasm. In this study, we examine a D2D group wherein all D2D transmitters (D2D-TXs) collaborate to serve users alongside the utilization of wireless power transfer for charging D2D-TXs. We consolidate the cache capacities of all D2D-TXs into a single entity and formulate a unified caching policy. Additionally, we design an incentive power mechanism aimed at users with social consciousness to incentivize D2D-TXs. To meet users' quality of service (QoS) requirements, we employ the Poisson point process and a hexagonal grid model to assess the likelihood of successful content delivery from base stations (BSs) and D2D-TXs to a user situated at the center of the D2D group. Addressing users' waiting time constraints, we evaluate the cumulative waiting time using inter-contact and G/G/1 queueing models. A Stackelberg game framework is employed to resolve conflict between D2D-TXs and users. The objective is to achieve a Stackelberg equilibrium, wherein users minimize costs by establishing an incentive power benchmark based on their QoS, while D2D-TXs maximize utility through optimized content caching strategies. Simulation results demonstrate that cooperative caching, with equitable distribution of cached contents among D2D-TXs, yields lower total waiting time than non-cooperative caching. Furthermore, as user density, total cache size, and data skewness increase, our proposed caching scheme exhibits minimal total waiting time for D2D-TXs and users.
KW - D2D
KW - Stackelberg game
KW - cooperative caching
KW - game theory
KW - social awareness
KW - wireless power transfer
UR - http://www.scopus.com/inward/record.url?scp=85217631367&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2025.3539106
DO - 10.1109/ACCESS.2025.3539106
M3 - Article
AN - SCOPUS:85217631367
SN - 2169-3536
VL - 13
SP - 26765
EP - 26781
JO - IEEE Access
JF - IEEE Access
ER -