Abstract
In a cache-enabled D2D underlaid cellular network, cooperation of BS caching and D2D caching can further exploit the limited storage capacity and achieve more efficient wireless resource utilization. In this complex network scenario, the closed form expression for successful transmission probability is firstly derived using stochastic geometry, to measure the proportion of users satisfying the delay guarantee. On this basis, a cooperative caching placement problem is formulated to maximize the successful transmission probability. We prove it can be transformed equivalently into a biconvex problem and then a block coordinate descent based algorithm is proposed. Simulation results demonstrate the performance gain of the proposed cooperative caching placement.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
