Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 2020 | public
Journal Article

Mode Selection and Power Allocation in Multi-level Cache-enabled Networks

Abstract

Moving contents proximity to the network edge and proactively caching popular contents at multiple infrastructures are promising directions for solving the backhaul congestion problem. This letter proposes and evaluates a multi-level cache-enabled network, where cache-hit users can fetch their data from the available cache at either small base-stations, unmanned aerial vehicles, or cache-enabled mobile device-to-device users. Cache-miss users, on the other hand, fetch their data from the central cloud via limited capacity backhaul links. This letter considers the problem of maximizing the network weighted-sum rate by jointly determining the users' mode of operation and their transmit powers, subject to backhaul capacity and transmit power constraints. After showing how the association problem can be formulated as a generalized assignment problem, the letter solves the transmit power problem using an iterative function evaluation apprach. The resulting mode-selection and power-allocation (MSPA) iterative algorithm is then tested through numerical simulations, which suggest that, while being easily implementable, the proposed multi-level caching can substantially relieve the backhaul congestion, especially in dense-networks, and at low-backhaul capacity regimes.

Additional Information

© 2020 IEEE. Manuscript received March 13, 2020; revised April 26, 2020; accepted May 6, 2020. Date of publication May 19, 2020; date of current version August 12, 2020. Hayssam Dahrouj would like to thank Effat University in Jeddah, Saudi Arabia, for funding this research reported in this letter through the Research and Consultancy Institute. The associate editor coordinating the review of this letter and approving it for publication was H. Zhang.

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023