IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v80y2022i4d10.1007_s11235-022-00918-x.html
   My bibliography  Save this article

Energy harvesting maximization for multiuser MIMO SWIPT systems with intelligent reflecting surfaces

Author

Listed:
  • Pham Van Quyet

    (Ho Chi Minh City University of Technology (HCMUT)
    Vietnam National University Ho Chi Minh City)

  • Ha Hoang Kha

    (Ho Chi Minh City University of Technology (HCMUT)
    Vietnam National University Ho Chi Minh City)

Abstract

This paper studies the harvested energy maximization in an intelligent reflecting surface (IRS) aided multiuser multiple-input multiple-output (MIMO) simultaneous wireless information and power transfer (SWIPT) system in which the users can exploit power-splitting (PS) techniques for information decoding and energy harvesting (EH) simultaneously. A design problem is mathematically formulated as a joint optimization problem of transmit precoding (TPC) matrices at the base station (BS), the phase shifts at the IRS, and EH PS factors at the users to maximize the total harvested energy at the users while guaranteeing the quality of service requirements in terms of minimum achievable user rates and minimum harvested energy at each user. Considering the nonlinear EH models of the practical EH circuits at the users and unit-modulus constraints of the IRS phase shifters, the design problem becomes a highly nonlinear and non-convex optimization problem of the coupled matrix variables. To tackle the mathematical challenges in seeking the optimal solutions, we adopt alternating optimization to decompose the original design problem into two subproblems. The first subproblem is to jointly determine the TPC matrices at the BS and PS factors at the users while the second subproblem is to obtain the phase shifts at the IRS. Since each subproblem is still a non-convex optimization problem, we employ the minorization-maximization method to devise lower bound concave functions for the nonlinear EH and user rate functions and find the appropriate convex inner sets of the feasible sets to transform the optimization problems into convex ones. Verified by simulation results that the convergence of the proposed iterative algorithm is guaranteed and the total harvested energy is significantly improved as the multiuser MIMO SWIPT system is aided by the IRS with optimal phase shifts.

Suggested Citation

  • Pham Van Quyet & Ha Hoang Kha, 2022. "Energy harvesting maximization for multiuser MIMO SWIPT systems with intelligent reflecting surfaces," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 80(4), pages 497-511, August.
  • Handle: RePEc:spr:telsys:v:80:y:2022:i:4:d:10.1007_s11235-022-00918-x
    DOI: 10.1007/s11235-022-00918-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-022-00918-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11235-022-00918-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Amir Beck & Aharon Ben-Tal & Luba Tetruashvili, 2010. "A sequential parametric convex approximation method with applications to nonconvex truss topology design problems," Journal of Global Optimization, Springer, vol. 47(1), pages 29-51, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yoshihiro Kanno, 2018. "Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach," Computational Optimization and Applications, Springer, vol. 71(2), pages 403-433, November.
    2. Francisco Facchinei & Vyacheslav Kungurtsev & Lorenzo Lampariello & Gesualdo Scutari, 2021. "Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 595-627, May.
    3. Alfredo Canelas & Miguel Carrasco & Julio López, 2017. "Application of the sequential parametric convex approximation method to the design of robust trusses," Journal of Global Optimization, Springer, vol. 68(1), pages 169-187, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:80:y:2022:i:4:d:10.1007_s11235-022-00918-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.