Cooperative Crossing Cache Placement in Cache-Enabled Device to Device-Aided Cellular Networks

Abstract

In cache-enabled device-to-device (D2D) -aided cellular networks, the technique of caching contents in the cooperative crossing between base stations (BSs) and devices can significantly reduce core traffic and enhance network capacity. In this paper, we propose a scheme that establishes device availability, which indicates whether a cache-enabled device can handle the transmission of the desired content within the required sending time, called the delay, while achieving optimal probabilistic caching. We also investigate the impact of transmission device availability on the effectiveness of a scenario of cooperative crossing cache placement, where content delivery traffic can be offloaded from the local cache, a D2D transmitter’s cache via a D2D link, or else directly from a BS via a cellular link, in order to maximize the offloading probability. Further, we derive the cooperation content offloading strategy while considering successful content transmission by D2D transmitters or BSs to guarantee the delay, even though reducing the delay is not the focus of this study. Finally, the proposed problem is formulated. Owing to the non-convexity of the optimization problem, it can be rewritten as a minimization of the difference between the convex functions; thus, it can be solved by difference of convex (DC) programming using a low-complexity algorithm. Simulation results show that the proposed cache placement scheme improves the offloading probability by 13.5% and 23% compared to Most Popular Content (MPC) scheme, in which both BSs and devices cache the most popular content and Coop. BS/D2D caching scheme, in which each BS tier and user tier applies cooperative content caching separately.

Traffic Offloading for Content Distribution Assisted With Device-to-Device Communications

“…In the literature, there have been many studies on the content caching strategies in D2D networks. For instance, an optimal content caching approach was proposed in [10] to maximize offloading probability with effective transmission accessibility between devices. In [13], the authors studied a probabilistic caching placement strategy for stochastic D2D caching networks, and obtained the optimal caching probabilities that maximize the requests successfully served by local device caches.…”

“…For example, content requests can be offloaded from a base station (BS) by caching received contents in user devices and fulfilling other nearby requests via D2D forwarding. Device caching strategies are investigated in [8]- [10], assuming that D2D users are cooperative and willing to cache a video that is not requested by themselves. Social-awareness is further taken into account in [11], [12], so that D2D users are more incentivized to cache and forward contents for their social connections.…”

Caching and Placement for In‐Network Caching in Device‐to‐Device Communications

“…Several studies on D2D networks have focused on different aspects of the caching placement policy to improve the efficiency of cache [14][15][16][17][18]. The authors of [14] showed an optimal caching placement scheme to maximize the offloading probability with considering the impact of transmission device availability.…”

“…Several studies on D2D networks have focused on different aspects of the caching placement policy to improve the efficiency of cache [14][15][16][17][18]. The authors of [14] showed an optimal caching placement scheme to maximize the offloading probability with considering the impact of transmission device availability. In [15], the authors described a probabilistic caching placement scheme that takes the cacheaided throughput into account; it measures the density of successfully served requests through own local cache of the user or through its nearby devices via D2D transmission.…”

“…Constraint (13) dictates that the desired content at a DT cannot exceed the cache storage capacity constraint of the device. Constraints (14) and (15) ensure that requested content cached in one of the DTs can be shared with only one requesting user and that each requesting user can communicate with only one DT that provides content, respectively. Constraint (16) defines the range of the content caching decision probability.…”