TY - JOUR
T1 - Optimal algorithms in wireless utility maximization
T2 - Proportional fairness decomposition and nonlinear perron-frobenius theory framework
AU - Zheng, Liang
AU - Tan, Chee Wei
PY - 2014/4
Y1 - 2014/4
N2 - We study the network utility maximization problems in wireless networks for service differentiation that optimize the Signal-to-Interference-plus-Noise Radio (SINR) and reliability under Rayleigh fading. Though seemingly nonconvex, we show that these problems can be decomposed into an optimization framework where each user calculates a payment for a given resource allocation, and the network uses the payment to optimize the performance of the user. We study three important examples of this utility maximization, namely the weighted sum logarithmic SINR maximization, the weighted sum inverse SINR minimization and the weighted sum logarithmic reliability maximization. These problems have hitherto been solved suboptimally in the literature. By exploiting the positivity, quasi-concavity and homogeneity properties in these problems and using the nonlinear Perron-Frobenius theory, we propose fixed-point algorithms that converge geometrically fast to the globally optimal solution. Numerical evaluations show that our algorithms are stable (free of parameter configuration) and computationally fast. © 2002-2012 IEEE.
AB - We study the network utility maximization problems in wireless networks for service differentiation that optimize the Signal-to-Interference-plus-Noise Radio (SINR) and reliability under Rayleigh fading. Though seemingly nonconvex, we show that these problems can be decomposed into an optimization framework where each user calculates a payment for a given resource allocation, and the network uses the payment to optimize the performance of the user. We study three important examples of this utility maximization, namely the weighted sum logarithmic SINR maximization, the weighted sum inverse SINR minimization and the weighted sum logarithmic reliability maximization. These problems have hitherto been solved suboptimally in the literature. By exploiting the positivity, quasi-concavity and homogeneity properties in these problems and using the nonlinear Perron-Frobenius theory, we propose fixed-point algorithms that converge geometrically fast to the globally optimal solution. Numerical evaluations show that our algorithms are stable (free of parameter configuration) and computationally fast. © 2002-2012 IEEE.
KW - network utility maximization
KW - nonlinear Perron-Frobenius theory
KW - Optimization
KW - resource allocation
UR - http://www.scopus.com/inward/record.url?scp=84899953685&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84899953685&origin=recordpage
U2 - 10.1109/TWC.2013.020714.130980
DO - 10.1109/TWC.2013.020714.130980
M3 - RGC 21 - Publication in refereed journal
SN - 1536-1276
VL - 13
SP - 2086
EP - 2095
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 4
M1 - 6747287
ER -