Skip to content
naulon
Not checkedNot checked for notices yet.

Energy-Efficient OFDM Radio Resource Allocation Optimization With Computational Awareness: A Survey

Bartosz Bossy, Pawel Kryszkiewicz, Hanna Bogucka

IEEE Access · 2022

doi:10.1109/access.2022.3203575 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In this paper, we review radio resource optimization methods for energy-efficient wireless communication in links and networks using the Orthogonal Frequency Division Multiplexing (OFDM) and Orthogonal Frequency Division Multiple Access (OFDMA) techniques. We first consider the energy-efficiency metrics and optimization goals. We discuss the increasingly complex systems, starting from (i) a single OFDM link, (ii) an OFDMA single-hop network to (iii) multi-hop relay OFDMA interference networks. In each case, we elaborate on the transmission rate estimation, power consumption modelling, existing optimization constraints and the optimization solutions. Specifically, in the power-consumption modelling, we include the signal-processing (and related computing) power. We discuss the practicality of the considered solutions. We also touch upon the problem of nonlinear power amplifier characteristics (causing distortions typical for OFDM signals) to be taken into account for energy-efficient resource allocation. We discuss trade-offs and provide recommendations for future energy-efficient OFDM networks design. We also discuss the future works and challenges in the context of energy efficiency resource allocation for OFDM/OFDMA and their derivative techniques. We conclude that the presented design practices should include computational awareness in the networks to trade-off between information communication, information processing and the required network management energy-efficiency.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.