Joint Power Control and Caching for Transmission Delay Minimization in Wireless HetNets

被引:3
作者
Malak, Derya [1 ]
Mutlu, Faruk Volkan [2 ]
Zhang, Jinkun [2 ]
Yeh, Edmund M. [2 ]
机构
[1] Ecole Ingn & Ctr Rech Sci Numer EURECOM, Commun Syst Dept, F-06904 Sophia Antipolis, France
[2] Northeastern Univ, Elect & Comp Engn Dept, Boston, MA 02115 USA
基金
欧洲研究理事会;
关键词
Wireless joint power-caching optimization; biconvexity; alternating optimization; quasi-convexity; Pareto optimality; OPTIMIZATION; ALGORITHM; NETWORKS; CAPACITY; RADIO;
D O I
10.1109/TNET.2023.3319674
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A fundamental challenge in wireless heterogeneous networks (HetNets) is to effectively utilize the limited transmission and storage resources in the presence of increasing deployment density and backhaul capacity constraints. To alleviate bottlenecks and reduce resource consumption, we design optimal caching and power control algorithms for multi-hop wireless HetNets. We formulate a joint optimization framework to minimize the average transmission delay as a function of the caching variables and the signal-to-interference-plus-noise ratios (SINR) which are determined by the transmission powers, while explicitly accounting for backhaul connection costs and the power constraints. Using convex relaxation and rounding, we obtain a reduced-complexity formulation (RCF) of the joint optimization problem, which can provide a constant factor approximation to the globally optimal solution. We then solve RCF in two ways: 1) alternating optimization of the power and caching variables by leveraging biconvexity, and 2) joint optimization of power control and caching. We characterize the necessary (KKT) conditions for an optimal solution to RCF, and use quasi-convexity to show that the KKT points are Pareto optimal for RCF. We then devise a subgradient projection algorithm to jointly update the caching and power variables under general SINR conditions. Finally, our analytical findings are supported by results from extensive numerical experiments.
引用
收藏
页码:1477 / 1492
页数:16
相关论文
共 80 条
  • [1] Content Caching and Scheduling in Wireless Networks With Elastic and Inelastic Traffic
    Abedini, Navid
    Shakkottai, Srinivas
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2014, 22 (03) : 864 - 874
  • [2] Pipage rounding: A new method of constructing algorithms with proven performance guarantee
    Ageev, AA
    Sviridenko, MI
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2004, 8 (03) : 307 - 328
  • [3] Caching on the World Wide Web
    Aggarwal, C
    Wolf, JL
    Yu, PS
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1999, 11 (01) : 94 - 107
  • [4] What Will 5G Be?
    Andrews, Jeffrey G.
    Buzzi, Stefano
    Choi, Wan
    Hanly, Stephen V.
    Lozano, Angel
    Soong, Anthony C. K.
    Zhang, Jianzhong Charlie
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2014, 32 (06) : 1065 - 1082
  • [5] [Anonymous], 2016, ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)
  • [6] APPROXIMATION ALGORITHMS FOR DATA PLACEMENT PROBLEMS
    Baev, Ivan
    Rajaraman, Rajmohan
    Swamy, Chaitanya
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (04) : 1411 - 1429
  • [7] Barbarossa S, 2013, IEEE INT WORK SIGN P, P26, DOI 10.1109/SPAWC.2013.6612005
  • [8] Beck A, 2017, MOS-SIAM SER OPTIMIZ, P1, DOI 10.1137/1.9781611974997
  • [9] Exact analysis of TTL cache networks
    Berger, Daniel S.
    Gland, Philipp
    Singla, Sahil
    Ciucu, Florin
    [J]. PERFORMANCE EVALUATION, 2014, 79 : 2 - 23
  • [10] Bertsekas DP., 1999, Athena scientific optimization and computation series