The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Neste artigo, propomos um esquema de alocação de sub-bandas de frequência para obter vazão máxima em um sistema de acesso múltiplo por divisão de frequência ortogonal (OFDMA), onde cada usuário tem um número finito de pacotes para transmitir, que são gerados a partir de chamadas de pacotes com tamanho arbitrário. e taxa de chegada arbitrária. O esquema proposto é avaliado em termos de rendimento e justiça do usuário em comparação com o esquema de justiça proporcional (PF) e o esquema Greedy sob a condição de comprimento de fila finita. Os resultados numéricos mostram que o esquema proposto é superior ao esquema Greedy em termos de rendimento e justiça para comprimentos de fila finitos.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Soonchul PARK, Sungho HWANG, Ho-Shin CHO, "A Throughput Enhancement under a Finite Buffer Capacity in OFDMA System" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 11, pp. 3537-3540, November 2009, doi: 10.1587/transcom.E92.B.3537.
Abstract: In this paper, we propose a scheme of frequency sub-band allocation to obtain maximum throughput in an orthogonal frequency division multiple access (OFDMA) system where each user has a finite number of packets to transmit, which are generated from packet calls with arbitrary size and arbitrary arrival rate. The proposed scheme is evaluated in terms of throughput and user fairness in comparison with the proportional fairness (PF) scheme and the Greedy scheme under the finite queue length condition. Numerical results show that the proposed scheme is superior to the Greedy scheme in terms of both throughput and fairness for finite queue length.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.3537/_p
Copiar
@ARTICLE{e92-b_11_3537,
author={Soonchul PARK, Sungho HWANG, Ho-Shin CHO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Throughput Enhancement under a Finite Buffer Capacity in OFDMA System},
year={2009},
volume={E92-B},
number={11},
pages={3537-3540},
abstract={In this paper, we propose a scheme of frequency sub-band allocation to obtain maximum throughput in an orthogonal frequency division multiple access (OFDMA) system where each user has a finite number of packets to transmit, which are generated from packet calls with arbitrary size and arbitrary arrival rate. The proposed scheme is evaluated in terms of throughput and user fairness in comparison with the proportional fairness (PF) scheme and the Greedy scheme under the finite queue length condition. Numerical results show that the proposed scheme is superior to the Greedy scheme in terms of both throughput and fairness for finite queue length.},
keywords={},
doi={10.1587/transcom.E92.B.3537},
ISSN={1745-1345},
month={November},}
Copiar
TY - JOUR
TI - A Throughput Enhancement under a Finite Buffer Capacity in OFDMA System
T2 - IEICE TRANSACTIONS on Communications
SP - 3537
EP - 3540
AU - Soonchul PARK
AU - Sungho HWANG
AU - Ho-Shin CHO
PY - 2009
DO - 10.1587/transcom.E92.B.3537
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2009
AB - In this paper, we propose a scheme of frequency sub-band allocation to obtain maximum throughput in an orthogonal frequency division multiple access (OFDMA) system where each user has a finite number of packets to transmit, which are generated from packet calls with arbitrary size and arbitrary arrival rate. The proposed scheme is evaluated in terms of throughput and user fairness in comparison with the proportional fairness (PF) scheme and the Greedy scheme under the finite queue length condition. Numerical results show that the proposed scheme is superior to the Greedy scheme in terms of both throughput and fairness for finite queue length.
ER -