Base station transmitting antenna arrays for multipath environments
Signal Processing
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Convex Optimization
Robust downlink power control in wireless cellular systems
EURASIP Journal on Wireless Communications and Networking - Special issue on multiuser MIMO networks
QoS-based resource allocation and transceiver optimization
Communications and Information Theory
Resource Allocation in Wireless Networks: Theory and Algorithms (Lecture Notes in Computer Science)
Resource Allocation in Wireless Networks: Theory and Algorithms (Lecture Notes in Computer Science)
Generalized nash bargaining solution for bandwidth allocation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Concave and Convex Interference Functions—General Characterizations and Applications
IEEE Transactions on Signal Processing - Part I
Power Control By Geometric Programming
IEEE Transactions on Wireless Communications
Log-convexity of the minimum total power in CDMA systems with certain quality-of-service guaranteed
IEEE Transactions on Information Theory
The Structure of General Interference Functions and Applications
IEEE Transactions on Information Theory
A Calculus for Log-Convex Interference Functions
IEEE Transactions on Information Theory
A framework for uplink power control in cellular radio systems
IEEE Journal on Selected Areas in Communications
A unifying approach to interference modeling for wireless networks
IEEE Transactions on Signal Processing
Cooperative resource allocation games under spectral mask and total power constraints
IEEE Transactions on Signal Processing
Revisiting proportional fairness: anonymity among users in interference coupled wireless systems
IEEE Transactions on Communications
Pareto boundary of utility sets for multiuser wireless systems
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
Nash bargaining and proportional fairness are popular strategies for distributing resources among competing users. Under the conventional assumption of a convex compact utility set, both techniques yield the same unique solution. In this paper, we show that uniqueness is preserved for a broader class of logarithmically convex sets. Then, we study a scenario where the performance of each user is measured by its signal-to-interference ratio (SIR). The SIR is modeled by an axiomatic framework of log-convex interference functions. No power constraints are assumed. It is shown how existence and uniqueness of a proportionally fair optimizer depends on the interference coupling among the users. Finally, we analyze the feasible SIR set. Conditions are derived under which the Nash bargaining strategy has a single-valued solution.