Illustration of the D2D caching network, the top left side figure is the snapshot of BSs (red stars), D2D-TXs (dark blue diamonds), and users (light blue dots) deployed w...
Abstract:
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 c...Show MoreMetadata
Abstract:
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.
Illustration of the D2D caching network, the top left side figure is the snapshot of BSs (red stars), D2D-TXs (dark blue diamonds), and users (light blue dots) deployed w...
Published in: IEEE Access ( Volume: 13)
Funding Agency:
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Social Awareness ,
- Wireless Power Transfer ,
- Content Caching ,
- Stackelberg Game Approach ,
- Simulation Results ,
- Hexagonal ,
- Service Quality ,
- Total Size ,
- Base Station ,
- Battery Power ,
- Usage Time ,
- Waiting Time ,
- Poisson Process ,
- Successful Delivery ,
- Content Delivery ,
- Wireless Power ,
- Queueing System ,
- Wireless Transfer ,
- Quality Of Service Requirements ,
- Cache Size ,
- Small Base Stations ,
- Content Request ,
- Content Popularity ,
- Signal-to-interference-plus-noise Ratio ,
- Cache Hit ,
- Probability Of Delivery ,
- Net Power ,
- Zipf Distribution ,
- User Groups ,
- Optimization Problem
- Author Keywords
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Social Awareness ,
- Wireless Power Transfer ,
- Content Caching ,
- Stackelberg Game Approach ,
- Simulation Results ,
- Hexagonal ,
- Service Quality ,
- Total Size ,
- Base Station ,
- Battery Power ,
- Usage Time ,
- Waiting Time ,
- Poisson Process ,
- Successful Delivery ,
- Content Delivery ,
- Wireless Power ,
- Queueing System ,
- Wireless Transfer ,
- Quality Of Service Requirements ,
- Cache Size ,
- Small Base Stations ,
- Content Request ,
- Content Popularity ,
- Signal-to-interference-plus-noise Ratio ,
- Cache Hit ,
- Probability Of Delivery ,
- Net Power ,
- Zipf Distribution ,
- User Groups ,
- Optimization Problem
- Author Keywords