QoS-based resource allocation and transceiver optimization
Communications and Information Theory
A general theory for SIR balancing
EURASIP Journal on Wireless Communications and Networking
Unifying view on min-max fairness, max-min fairness, and utility optimization incellular networks
EURASIP Journal on Wireless Communications and Networking
IEEE/ACM Transactions on Networking (TON)
Segregating in- and other-cell interference with applications to decentralized admission control
IEEE Transactions on Communications
Nash bargaining and proportional fairness for wireless systems
IEEE/ACM Transactions on Networking (TON)
Characterization of SINR region for interfering links with constrained power
IEEE Transactions on Information Theory
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 754.90 |
In this correspondence, we consider a code-division multiple-access (CDMA) channel with a linear receiver structure whose inputs are subject to a total power constraint. Each user is required to satisfy a certain quality-of-service (QoS) requirement expressed, for instance, in terms of data rate or delay. The set of all feasible QoS requirements is called the feasibility region. It is shown that if the signal-to-interference ratio (SIR) at the output of each linear receiver is a bijective and log-convex function of the QoS parameter of interest, the minimum total power needed to satisfy the QoS requirements is a jointly log-convex function of the QoS parameters. Furthermore, in two special cases of practical interest, we show that the minimum total power is strictly log-convex. These results imply that the corresponding feasibility regions are convex sets. The convexity property is a key ingredient in the development of access control strategies for wireless communications systems.