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
A integração de relés multihop com infraestruturas celulares de acesso múltiplo por divisão de frequência ortogonal (OFDMA) pode atender às crescentes demandas por melhor cobertura e maior rendimento. A alocação de recursos no sistema de retransmissão OFDMA de dois saltos é mais complexa do que no sistema OFDMA convencional de salto único. Com a divisão de tempo entre as transmissões da estação base (BS) e as das estações retransmissoras (RSs), o particionamento fixo do subquadro BS e dos subquadros RS não pode se adaptar às diversas demandas de tráfego. Além disso, algoritmos de escalonamento de salto único não podem ser usados diretamente no sistema de dois saltos. Portanto, propomos um algoritmo semidistribuído chamado ASP para ajustar o comprimento de cada subquadro de forma adaptativa e sugerimos duas maneiras de estender algoritmos de escalonamento de salto único em cenários multihop: abordagens baseadas em links e abordagens ponta a ponta. Os resultados da simulação indicam que o algoritmo ASP aumenta a utilização e a justiça do sistema. Os algoritmos de escalonamento de razão portadora-interferência máxima (C/I máx.) e justiça proporcional (PF) estendidos usando a abordagem ponta a ponta obtêm rendimento mais alto do que aqueles que usam a abordagem baseada em enlace, mas às custas de mais sobrecarga para troca de informações entre o BS e os RSs. O esquema de alocação de recursos usando ASP e agendamento PF ponta a ponta consegue um equilíbrio entre a maximização do rendimento do sistema e a justiça.
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
Liping WANG, Yusheng JI, Fuqiang LIU, "Adaptive Subframe Partitioning and Efficient Packet Scheduling in OFDMA Cellular System with Fixed Decode-and-Forward Relays" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 3, pp. 755-765, March 2009, doi: 10.1587/transcom.E92.B.755.
Abstract: The integration of multihop relays with orthogonal frequency-division multiple access (OFDMA) cellular infrastructures can meet the growing demands for better coverage and higher throughput. Resource allocation in the OFDMA two-hop relay system is more complex than that in the conventional single-hop OFDMA system. With time division between transmissions from the base station (BS) and those from relay stations (RSs), fixed partitioning of the BS subframe and RS subframes can not adapt to various traffic demands. Moreover, single-hop scheduling algorithms can not be used directly in the two-hop system. Therefore, we propose a semi-distributed algorithm called ASP to adjust the length of every subframe adaptively, and suggest two ways to extend single-hop scheduling algorithms into multihop scenarios: link-based and end-to-end approaches. Simulation results indicate that the ASP algorithm increases system utilization and fairness. The max carrier-to-interference ratio (Max C/I) and proportional fairness (PF) scheduling algorithms extended using the end-to-end approach obtain higher throughput than those using the link-based approach, but at the expense of more overhead for information exchange between the BS and RSs. The resource allocation scheme using ASP and end-to-end PF scheduling achieves a tradeoff between system throughput maximization and fairness.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.755/_p
Copiar
@ARTICLE{e92-b_3_755,
author={Liping WANG, Yusheng JI, Fuqiang LIU, },
journal={IEICE TRANSACTIONS on Communications},
title={Adaptive Subframe Partitioning and Efficient Packet Scheduling in OFDMA Cellular System with Fixed Decode-and-Forward Relays},
year={2009},
volume={E92-B},
number={3},
pages={755-765},
abstract={The integration of multihop relays with orthogonal frequency-division multiple access (OFDMA) cellular infrastructures can meet the growing demands for better coverage and higher throughput. Resource allocation in the OFDMA two-hop relay system is more complex than that in the conventional single-hop OFDMA system. With time division between transmissions from the base station (BS) and those from relay stations (RSs), fixed partitioning of the BS subframe and RS subframes can not adapt to various traffic demands. Moreover, single-hop scheduling algorithms can not be used directly in the two-hop system. Therefore, we propose a semi-distributed algorithm called ASP to adjust the length of every subframe adaptively, and suggest two ways to extend single-hop scheduling algorithms into multihop scenarios: link-based and end-to-end approaches. Simulation results indicate that the ASP algorithm increases system utilization and fairness. The max carrier-to-interference ratio (Max C/I) and proportional fairness (PF) scheduling algorithms extended using the end-to-end approach obtain higher throughput than those using the link-based approach, but at the expense of more overhead for information exchange between the BS and RSs. The resource allocation scheme using ASP and end-to-end PF scheduling achieves a tradeoff between system throughput maximization and fairness.},
keywords={},
doi={10.1587/transcom.E92.B.755},
ISSN={1745-1345},
month={March},}
Copiar
TY - JOUR
TI - Adaptive Subframe Partitioning and Efficient Packet Scheduling in OFDMA Cellular System with Fixed Decode-and-Forward Relays
T2 - IEICE TRANSACTIONS on Communications
SP - 755
EP - 765
AU - Liping WANG
AU - Yusheng JI
AU - Fuqiang LIU
PY - 2009
DO - 10.1587/transcom.E92.B.755
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2009
AB - The integration of multihop relays with orthogonal frequency-division multiple access (OFDMA) cellular infrastructures can meet the growing demands for better coverage and higher throughput. Resource allocation in the OFDMA two-hop relay system is more complex than that in the conventional single-hop OFDMA system. With time division between transmissions from the base station (BS) and those from relay stations (RSs), fixed partitioning of the BS subframe and RS subframes can not adapt to various traffic demands. Moreover, single-hop scheduling algorithms can not be used directly in the two-hop system. Therefore, we propose a semi-distributed algorithm called ASP to adjust the length of every subframe adaptively, and suggest two ways to extend single-hop scheduling algorithms into multihop scenarios: link-based and end-to-end approaches. Simulation results indicate that the ASP algorithm increases system utilization and fairness. The max carrier-to-interference ratio (Max C/I) and proportional fairness (PF) scheduling algorithms extended using the end-to-end approach obtain higher throughput than those using the link-based approach, but at the expense of more overhead for information exchange between the BS and RSs. The resource allocation scheme using ASP and end-to-end PF scheduling achieves a tradeoff between system throughput maximization and fairness.
ER -