Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/29162
Title: Combining Lyapunov Optimization With Evolutionary Transfer Optimization for Long-Term Energy Minimization in IRS-Aided Communications
Authors: Huang, P-Q
Wang, Y
Wang, K
Zhang, Q
Keywords: dynamic environment;evolutionary algorithm (EA);evolutionary transfer optimization (ETO);intelligent reflecting surface (IRS);Lyapunov optimization
Issue Date: 9-May-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE).
Citation: Huang, P.-Q. et al. (2023) 'Combining Lyapunov Optimization With Evolutionary Transfer Optimization for Long-Term Energy Minimization in IRS-Aided Communications', IEEE Transactions on Cybernetics, 53 (4), pp. 2647 - 2657. doi: 10.1109/TCYB.2022.3168839.
Abstract: This article studies an intelligent reflecting surface (IRS)-aided communication system under the time-varying channels and stochastic data arrivals. In this system, we jointly optimize the phase-shift coefficient and the transmit power in sequential time slots to maximize the long-term energy consumption for all mobile devices while ensuring queue stability. Due to the dynamic environment, it is challenging to ensure queue stability. In addition, making real-time decisions in each short time slot also needs to be considered. To this end, we propose a method (called LETO) that combines Lyapunov optimization with evolutionary transfer optimization (ETO) to solve the above optimization problem. LETO first adopts Lyapunov optimization to decouple the long-term stochastic optimization problem into deterministic optimization problems in sequential time slots. As a result, it can ensure queue stability since the deterministic optimization problem in each time slot does not involve future information. After that, LETO develops an evolutionary transfer method to solve the optimization problem in each time slot. Specifically, we first define a metric to identify the optimization problems in past time slots similar to that in the current time slot, and then transfer their optimal solutions to construct a high-quality initial population in the current time slot. Since ETO effectively accelerates the search, we can make real-time decisions in each short time slot. Experimental studies verify the effectiveness of LETO by comparison with other algorithms.
URI: https://bura.brunel.ac.uk/handle/2438/29162
DOI: https://doi.org/10.1109/TCYB.2022.3168839
ISSN: 2168-2267
Other Identifiers: ORCiD: Pei-Qiu Huang https://orcid.org/0000-0001-6278-4566
ORCiD: Yong Wang https://orcid.org/0000-0001-7670-3958
ORCiD: Kezhi Wang https://orcid.org/0000-0001-8602-0800
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2022 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works by sending a request to pubs-permissions@ieee.org. See https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/ publishingethics/ for more information.6.47 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.