Joint Assortment and Cache Planning for Practical User Choice Model in Wireless Content Caching Networks

Yaru Fu, Xinyu Xu, Hanlin Liu, Quan Yu, Hong Ning Dai, Tony Q.S. Quek

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)


In wireless content caching networks (WCCNs), a user's content consumption crucially depends on the assortment offered. Here, the assortment refers to the recommendation list. An appropriate user choice model is essential for greater revenue. Therefore, in this paper, we propose a practical multinomial logit choice model to capture users' content requests. Based on this model, we first derive the individual demand distribution per user and then investigate the effect of the interplay between the assortment decision and cache planning on WCCNs' achievable revenue. A revenue maximization problem is formulated while incorporating the influences of the screen size constraints of users and the cache capacity budget of the base station (BS). The formulated optimization problem is a non-convex integer programming problem. For ease of analysis, we decompose it into two folds, i.e., the personalized assortment decision problem and the cache planning problem. By using structure-oriented geometric properties, we design an iterative algorithm with examinable quadratic time complexity to solve the non-convex assortment problem in an optimal manner. The cache planning problem is proved to be a 0-1 Knapsack problem and thus can be addressed by a dynamic programming approach with pseudo-polynomial time complexity. Afterwards, an alternating optimization method is used to optimize the two types of variables until convergence. It is shown by simulations that the proposed scheme outperforms various existing benchmark schemes.

頁(從 - 到)4709-4722
期刊IEEE Transactions on Mobile Computing
出版狀態Published - 2024 5月 1

All Science Journal Classification (ASJC) codes

  • 軟體
  • 電腦網路與通信
  • 電氣與電子工程


深入研究「Joint Assortment and Cache Planning for Practical User Choice Model in Wireless Content Caching Networks」主題。共同形成了獨特的指紋。