Generalized Firefly Algorithm for Optimal Transmit Beamforming
arXiv:2310.18460 · doi:10.1109/TWC.2023.3328713
Abstract
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.
References in corpus (7)
- A comprehensive review of firefly algorithms
- Optimal Multiuser Transmit Beamforming: A Difficult Problem with a Simple Solution Structure
- Robust Beamforming for Secure Communication in Systems with Wireless Information and Power Transfer
- Wireless Information and Power Transfer: Energy Efficiency Optimization in OFDMA Systems
- A Discrete Firefly Algorithm to Solve a Rich Vehicle Routing Problem Modelling a Newspaper Distribution System with Recycling Policy
- Robust Chance-Constrained Optimization for Power-Efficient and Secure SWIPT Systems
- Why the Firefly Algorithm Works?