TY - GEN
T1 - An interior point penalty method for utility maximization problems in OFDMA networks
AU - Mehrjoo, Mehri
AU - Moazeni, Somayeh
AU - Shen, Xuemin
PY - 2009
Y1 - 2009
N2 - This paper investigates the non-convexity of utility-based resource allocation problems in orthogonal frequency division multiple access (OFDMA) networks with heterogeneous traffic classes. Efficient transmission in OFDMA networks requires optimal resource allocation to users based on their current channel states. Also, utility-based resource allocation improves the network resource utilization and application level quality of service (QoS) provisioning. However, a major difficulty in using utility-based OFDMA resource allocation schemes is the non-convexity of corresponding optimization problem. In this paper, a continuous optimization technique is proposed to treat the non-convexity. The approach is based on a combination of penalty function methods and interior point methods. Numerical results demonstrate that the proposed approach solves the problem within limited time, and the solutions are close to near optimal solutions obtained by the search algorithm.
AB - This paper investigates the non-convexity of utility-based resource allocation problems in orthogonal frequency division multiple access (OFDMA) networks with heterogeneous traffic classes. Efficient transmission in OFDMA networks requires optimal resource allocation to users based on their current channel states. Also, utility-based resource allocation improves the network resource utilization and application level quality of service (QoS) provisioning. However, a major difficulty in using utility-based OFDMA resource allocation schemes is the non-convexity of corresponding optimization problem. In this paper, a continuous optimization technique is proposed to treat the non-convexity. The approach is based on a combination of penalty function methods and interior point methods. Numerical results demonstrate that the proposed approach solves the problem within limited time, and the solutions are close to near optimal solutions obtained by the search algorithm.
UR - http://www.scopus.com/inward/record.url?scp=70449461855&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449461855&partnerID=8YFLogxK
U2 - 10.1109/ICC.2009.5198735
DO - 10.1109/ICC.2009.5198735
M3 - Conference contribution
AN - SCOPUS:70449461855
SN - 9781424434350
T3 - IEEE International Conference on Communications
BT - Proceedings - 2009 IEEE International Conference on Communications, ICC 2009
T2 - 2009 IEEE International Conference on Communications, ICC 2009
Y2 - 14 June 2009 through 18 June 2009
ER -