Criteria on Utility Designing of Convex Optimization in FDMA Networks

TL;DR

This paper establishes criteria for designing utility functions to ensure convexity in network utility maximization for FDMA systems, facilitating optimal resource allocation and scheduling.

Contribution

It introduces a general form of utility functions satisfying convexity criteria and demonstrates their application in subcarrier scheduling through numerical case studies.

Findings

Utility functions satisfying the criteria enable convex optimization.

Proportional fairness and sigmoidal utility functions are consistent with the criteria.

Numerical results validate the effectiveness of the proposed utility design in FDMA scheduling.

Abstract

In this paper, we investigate the network utility maximization problem in FDMA systems. We summarize with a suite of criteria on designing utility functions so as to achieve the global optimization convex. After proposing the general form of the utility functions, we present examples of commonly used utility function forms that are consistent with the criteria proposed in this paper, which include the well-known proportional fairness function and the sigmoidal-like functions. In the second part of this paper, we use numerical results to demonstrate a case study based on the criteria mentioned above, which deals with the subcarrier scheduling problem with dynamic rate allocation in FDMA system.