Globally Optimal Resource Allocation Design for Discrete Phase Shift IRS-Assisted Multiuser Networks With Perfect and Imperfect CSI

被引:0
作者
Wu, Yifei [1 ]
Xu, Dongfang [2 ]
Ng, Derrick Wing Kwan [3 ]
Schober, Robert [1 ]
Gerstacker, Wolfgang [1 ]
机构
[1] Friedrich Alexander Univ Erlangen Nurnberg FAU, Inst Digital Commun, D-91054 Erlangen, Germany
[2] Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Peoples R China
[3] Univ New South Wales, Sch Elect Engn & Telecommun, Sydney, NSW 2052, Australia
基金
澳大利亚研究理事会;
关键词
Wireless communication; Resource management; Optimization; Phase shifters; Array signal processing; Vectors; Channel estimation; Approximation algorithms; Quality of service; Convergence; Generalized Benders decomposition method; optimal resource allocation; intelligent reflecting surface; INTELLIGENT REFLECTING SURFACE; WIRELESS NETWORK; ROBUST; OPTIMIZATION; SYSTEMS; SECURE; CONVERGENCE; COMMUNICATION; FRAMEWORK; CHANNEL;
D O I
10.1109/TWC.2024.3508101
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Intelligent reflecting surfaces (IRSs) are a promising low-cost solution for achieving high spectral and energy efficiency in future communication systems by enabling the customization of wireless propagation environments. Despite the plethora of research on resource allocation design for IRS-assisted multiuser wireless communication systems, the optimal design and the corresponding performance upper bound are still not fully understood. To bridge this gap in knowledge, in this paper, we investigate the optimal resource allocation design for IRS-assisted multiuser multiple-input single-output (MISO) systems employing practical discrete IRS phase shifters. In particular, we jointly optimize the beamforming vector at the base station (BS) and the discrete IRS phase shifts to minimize the total transmit power for the cases of perfect and imperfect channel state information (CSI) knowledge. To this end, two novel algorithms based on the generalized Benders decomposition (GBD) method are developed to obtain the globally optimal solution for perfect and imperfect CSI, respectively. Moreover, to facilitate practical implementation, we propose two corresponding low-complexity suboptimal algorithms with guaranteed convergence by capitalizing on successive convex approximation (SCA). In particular, for imperfect CSI, we adopt a bounded error model to characterize the CSI uncertainty and propose a new transformation to convexify the robust quality-of-service (QoS) constraints. Our numerical results confirm the optimality of the proposed GBD-based algorithms for the considered system for both perfect and imperfect CSI. Furthermore, we unveil that both proposed SCA-based algorithms can attain a locally optimal solution within a few iterations. Moreover, compared with the state-of-the-art solution based on alternating optimization (AO), the proposed low-complexity SCA-based schemes achieve a significant performance gain, especially for moderate-to-large numbers of IRS elements.
引用
收藏
页码:1306 / 1324
页数:19
相关论文
共 34 条
  • [1] Intelligent Reflecting Surface: Practical Phase Shift Model and Beamforming Optimization
    Abeywickrama, Samith
    Zhang, Rui
    Wu, Qingqing
    Yuen, Chau
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (09) : 5849 - 5863
  • [2] Bezdek J. C., 2002, Advances in Soft Computing - AFSS 2002. 2002 AFSS International Conference on Fuzzy Systems. Proceedings (Lecture Notes in Artificial Intelligence Vol.2275), P288
  • [3] Boyd SP, 2004, Convex Optimization, DOI 10.1017/CBO9780511804441
  • [4] An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs
    Dinh, Tao Pham
    Canh, Nam Nguyen
    Le Thi, Hoai An
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2010, 48 (04) : 595 - 632
  • [5] Dongfang Xu, 2021, 2021 55th Asilomar Conference on Signals, Systems, and Computers, P113, DOI 10.1109/IEEECONF53345.2021.9723093
  • [6] Geoffrion A. M., 1972, Journal of Optimization Theory and Applications, V10, P237, DOI 10.1007/BF00934810
  • [7] Grant Michael, 2014, CVX: Matlab software for disciplined convex programming, version 2.1, DOI DOI 10.1109/JSAC.2020.3007059
  • [8] DC Programming and DCA for General DC Programs
    Hoai An Le Thi
    Van Ngai Huynh
    Tao Pham Dinh
    [J]. ADVANCED COMPUTATIONAL METHODS FOR KNOWLEDGE ENGINEERING, 2014, 282 : 15 - 35
  • [9] Exact penalty and error bounds in DC programming
    Hoai An Le Thi
    Tao Pham Dinh
    Huynh Van Ngai
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2012, 52 (03) : 509 - 535
  • [10] Robust and Secure Sum-Rate Maximization for Multiuser MISO Downlink Systems With Self-Sustainable IRS
    Hu, Shaokang
    Wei, Zhiqiang
    Cai, Yuanxin
    Liu, Chang
    Ng, Derrick Wing Kwan
    Yuan, Jinhong
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (10) : 7032 - 7049