A Fair Energy Allocation Algorithm for IRS-Assisted Cognitive MISO Wireless-Powered Networks
With the rapid development of wireless communication networks and Internet of Things technology (IoT), higher requirements have been put forward for spectrum resource utilization and system performance. In order to further improve the utilization of spectrum resources and system performance, this pa...
Gespeichert in:
Veröffentlicht in: | Information (Basel) 2024-01, Vol.15 (1), p.49 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | With the rapid development of wireless communication networks and Internet of Things technology (IoT), higher requirements have been put forward for spectrum resource utilization and system performance. In order to further improve the utilization of spectrum resources and system performance, this paper proposes an intelligent reflecting surface (IRS)-assisted fair energy allocation algorithm for cognitive multiple-input single-output (MISO) wireless-powered networks. The goal of this paper is to maximize the minimum energy receiving power in the energy receiver, which is constrained by the signal-to-interference-plus-noise ratio (SINR) threshold of the information receiver in the secondary network, the maximum transmission power at the cognitive base station (CBS), and the interference power threshold of the secondary network on the main network. Due to the coupling between variables, this paper uses iterative optimization algorithms to optimize and solve different variables. That is, when solving the active beamforming variables, the passive beamforming variables are fixed; then, the obtained active beamforming variables are fixed, and the passive beamforming variables are solved. Through continuous iterative optimization, the system converges. The simulation results have verified the effectiveness of the proposed algorithm. |
---|---|
ISSN: | 2078-2489 2078-2489 |
DOI: | 10.3390/info15010049 |