Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
On achieving fairness and efficiency in high-speed shared medium access
IEEE/ACM Transactions on Networking (TON)
Power allocation and routing in multibeam satellites with time-varying channels
IEEE/ACM Transactions on Networking (TON)
Priority service and max-min fairness
IEEE/ACM Transactions on Networking (TON)
Convex Optimization
Signal Processing - Special section: Advances in signal processing-assisted cross-layer designs
A general theory for SIR balancing
EURASIP Journal on Wireless Communications and Networking
The interplay of link layer and physical layer under MIMO enhancement: benefits and challenges
IEEE Wireless Communications
IEEE Transactions on Wireless Communications
Power control and capacity of spread spectrum wireless networks
Automatica (Journal of IFAC)
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Log-convexity of the minimum total power in CDMA systems with certain quality-of-service guaranteed
IEEE Transactions on Information Theory
Capacity regions and optimal power allocation for CDMA cellular radio
IEEE Transactions on Information Theory
The Kullback–Leibler Divergence and Nonnegative Matrices
IEEE Transactions on Information Theory
Transmit beamforming and power control for cellular wireless systems
IEEE Journal on Selected Areas in Communications
A framework for uplink power control in cellular radio systems
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We are concerned with the control of quality of service (QoS) in wireless cellular networks utilizing linear receivers. We investigate the issues of fairness and total performance, which are measured by a utility function in the form of a weighted sum of link QoS. We disprove the common conjecture on incompatibility of min-max fairness and utility optimality by characterizing network classes in which both goals can be accomplished concurrently. We characterize power and weight allocations achieving min-max fairness and utility optimality and show that they correspond to saddle points of the utility function. Next, we address the problem of the difference between min-max fairness and max-min fairness. We show that in general there is a (fairness) gap between the performance achieved under min-max fairness and under max-min fairness. We characterize the network class for which both performance values coincide. Finally, we characterize the corresponding network subclass, in which both min-max fairness and max-min fairness are achievable by the same power allocation.