arrow
Return

Generalized Firefly Algorithm for Optimal Transmit Beamforming

delete2024-06-01
delete4
delete
OA
AI
T
Tuan Anh Le *
X
Xin‐She Yang
DOI:10.1109/TWC.2023.3328713delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper proposes a generalized Firefly Algorithm (FA) to solve an optimization framework having objective function and constraints as multivariate functions of independent optimization variables. Four representative examples of how the proposed generalized FA can be adopted to solve downlink beamforming problems are shown for a classic transmit beamforming, cognitive beamforming, reconfigurable-intelligent-surfaces-aided (RIS-aided) transmit beamforming, and RIS-aided wireless power transfer (WPT). Complexity analyzes indicate that in large-antenna regimes the proposed FA approaches require less computational complexity than their corresponding interior point methods (IPMs) do, yet demand a higher complexity than the iterative and the successive convex approximation (SCA) approaches do. Simulation results reveal that the proposed FA attains the same global optimal solution as that of the IPM for an optimization problem in cognitive beamforming. On the other hand, the proposed FA approaches outperform the iterative, IPM and SCA in terms of obtaining better solution for optimization problems, respectively, for a classic transmit beamforming, RIS-aided transmit beamforming and RIS-aided WPT.
Keywords:
Array signal processing
Optimization
Signal to noise ratio
Iterative methods
Interference
Brightness
Statistics
Firefly algorithm
nature-inspired optimization
transmit beamforming
reconfigurable intelligent surfaces

Journal

IEEE Transactions on Wireless Communications cover
IEEE Transactions on Wireless Communications
IF:
10.7
Papers:
1.3W
Citations:
5.3W

Organization

M
Middlesex University
Scholars:
1.6K
Papers: 1.9K
Citations: 56