This paper proposes computationally efficient algorithms to maximize the energy efficiency in multicarrier wireless interference networks, by a suitable allocation of the system radio resources, namely, the transmit powers and subcarrier assignment. The problem is formulated as the maximization of the system global energy efficiency subject to both maximum power and minimum rate constraints. This leads to a challenging nonconvex fractional problem, which is tackled through an interplay of fractional programming, learning, and game theory. The proposed algorithmic framework is provably convergent and has a complexity linear in both the number of users and subcarriers, whereas other available solutions can only guarantee a polynomial complexity in the number of users and subcarriers. Numerical results show that the proposed method performs similarly as other, more complex, algorithms.
A Learning Approach for Low-Complexity Optimization of Energy Efficiency in Multi-Carrier Wireless Networks / D’Oro, Salvatore; Zappone, Alessio; Palazzo, Sergio; Lops, Marco. - In: IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS. - ISSN 1536-1276. - (2018), pp. 3226-3241. [10.1109/TWC.2018.2808490]
A Learning Approach for Low-Complexity Optimization of Energy Efficiency in Multi-Carrier Wireless Networks
Lops Marco
2018
Abstract
This paper proposes computationally efficient algorithms to maximize the energy efficiency in multicarrier wireless interference networks, by a suitable allocation of the system radio resources, namely, the transmit powers and subcarrier assignment. The problem is formulated as the maximization of the system global energy efficiency subject to both maximum power and minimum rate constraints. This leads to a challenging nonconvex fractional problem, which is tackled through an interplay of fractional programming, learning, and game theory. The proposed algorithmic framework is provably convergent and has a complexity linear in both the number of users and subcarriers, whereas other available solutions can only guarantee a polynomial complexity in the number of users and subcarriers. Numerical results show that the proposed method performs similarly as other, more complex, algorithms.| File | Dimensione | Formato | |
|---|---|---|---|
|
doro_zappone_palazzo_lops.pdf
solo utenti autorizzati
Tipologia:
Documento in Post-print
Licenza:
Accesso privato/ristretto
Dimensione
1.13 MB
Formato
Adobe PDF
|
1.13 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


