Home > Research > Publications & Outputs > Weighted sum throughput maximization in heterog...

Electronic data

  • 186-61757-review

    Rights statement: ©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 458 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Text available via DOI:

View graph of relations

Weighted sum throughput maximization in heterogeneous OFDMA networks

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Weighted sum throughput maximization in heterogeneous OFDMA networks. / Siswanto, Diky; Zhang, Li X.; Navaie, Keivan et al.
IEEE VTC-Fall 2016. IEEE, 2016. (IEEE VTC-Fall 2016).

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

APA

Vancouver

Siswanto D, Zhang LX, Navaie K, G C D. Weighted sum throughput maximization in heterogeneous OFDMA networks. In IEEE VTC-Fall 2016. IEEE. 2016. (IEEE VTC-Fall 2016). doi: 10.1109/VTCSpring.2016.7504531

Author

Siswanto, Diky ; Zhang, Li X. ; Navaie, Keivan et al. / Weighted sum throughput maximization in heterogeneous OFDMA networks. IEEE VTC-Fall 2016. IEEE, 2016. (IEEE VTC-Fall 2016).

Bibtex

@inproceedings{df4963748bf5419eb54781d0b3c5ad1d,
title = "Weighted sum throughput maximization in heterogeneous OFDMA networks",
abstract = "We formulate the resource allocation in the downlink of heterogeneous orthogonal frequency division multiple access (OFDMA) networks. Our main objective is to maximize the system sum throughput subject to service and system constraints, including maximum transmit power, quality of service and peruser subchannel allocation. Due to the inter-cell interference the corresponding optimization problem is, in fact, nonconvex, that cannot be solved using standard convex optimization techniques. Here we propose an algorithm based on local search method and use of penalty function to approximate the formulated constrained optimization problem by an unconstrained one. To approximate a global optimal, we set escaping procedure from critical point based on constraint function conditions. The result shows that the proposed method might achieve optimum conditions by a hybrid of split and shared spectrum allocation. Numerical analysis indicates that the proposed algorithm outperform the other conventional methods in the scenario of high level of inter-cell interference with high number of users. In the case of small number of users, we further observe that the proposed method performs better than equal power allocation method (EPA). Moreover, the proposed method approximates the global optimum by considering channel gain and inter-cell interference with a fast rate of convergence.",
author = "Diky Siswanto and Zhang, {Li X.} and Keivan Navaie and {G C}, Deepak",
note = "{\textcopyright}2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.",
year = "2016",
month = may,
day = "18",
doi = "10.1109/VTCSpring.2016.7504531",
language = "English",
series = "IEEE VTC-Fall 2016",
publisher = "IEEE",
booktitle = "IEEE VTC-Fall 2016",

}

RIS

TY - GEN

T1 - Weighted sum throughput maximization in heterogeneous OFDMA networks

AU - Siswanto, Diky

AU - Zhang, Li X.

AU - Navaie, Keivan

AU - G C, Deepak

N1 - ©2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

PY - 2016/5/18

Y1 - 2016/5/18

N2 - We formulate the resource allocation in the downlink of heterogeneous orthogonal frequency division multiple access (OFDMA) networks. Our main objective is to maximize the system sum throughput subject to service and system constraints, including maximum transmit power, quality of service and peruser subchannel allocation. Due to the inter-cell interference the corresponding optimization problem is, in fact, nonconvex, that cannot be solved using standard convex optimization techniques. Here we propose an algorithm based on local search method and use of penalty function to approximate the formulated constrained optimization problem by an unconstrained one. To approximate a global optimal, we set escaping procedure from critical point based on constraint function conditions. The result shows that the proposed method might achieve optimum conditions by a hybrid of split and shared spectrum allocation. Numerical analysis indicates that the proposed algorithm outperform the other conventional methods in the scenario of high level of inter-cell interference with high number of users. In the case of small number of users, we further observe that the proposed method performs better than equal power allocation method (EPA). Moreover, the proposed method approximates the global optimum by considering channel gain and inter-cell interference with a fast rate of convergence.

AB - We formulate the resource allocation in the downlink of heterogeneous orthogonal frequency division multiple access (OFDMA) networks. Our main objective is to maximize the system sum throughput subject to service and system constraints, including maximum transmit power, quality of service and peruser subchannel allocation. Due to the inter-cell interference the corresponding optimization problem is, in fact, nonconvex, that cannot be solved using standard convex optimization techniques. Here we propose an algorithm based on local search method and use of penalty function to approximate the formulated constrained optimization problem by an unconstrained one. To approximate a global optimal, we set escaping procedure from critical point based on constraint function conditions. The result shows that the proposed method might achieve optimum conditions by a hybrid of split and shared spectrum allocation. Numerical analysis indicates that the proposed algorithm outperform the other conventional methods in the scenario of high level of inter-cell interference with high number of users. In the case of small number of users, we further observe that the proposed method performs better than equal power allocation method (EPA). Moreover, the proposed method approximates the global optimum by considering channel gain and inter-cell interference with a fast rate of convergence.

U2 - 10.1109/VTCSpring.2016.7504531

DO - 10.1109/VTCSpring.2016.7504531

M3 - Conference contribution/Paper

T3 - IEEE VTC-Fall 2016

BT - IEEE VTC-Fall 2016

PB - IEEE

ER -