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
OFDMA(직교 주파수 분할 다중 접속) 셀룰러 인프라와 멀티홉 릴레이를 통합하면 더 나은 적용 범위와 더 높은 처리량에 대한 증가하는 요구를 충족할 수 있습니다. OFDMA 2홉 릴레이 시스템의 자원 할당은 기존 단일 홉 OFDMA 시스템에 비해 더 복잡하다. 기지국(BS)의 전송과 중계국(RS)의 전송 간의 시간 분할로 인해 BS 서브프레임과 RS 서브프레임의 고정 분할은 다양한 트래픽 요구에 적응할 수 없습니다. 또한 단일 홉 스케줄링 알고리즘은 2홉 시스템에서 직접 사용할 수 없습니다. 따라서 우리는 모든 서브프레임의 길이를 적응적으로 조정하기 위해 ASP라는 반분산 알고리즘을 제안하고 단일 홉 스케줄링 알고리즘을 다중 홉 시나리오로 확장하는 두 가지 방법인 링크 기반 접근 방식과 엔드 투 엔드 접근 방식을 제안합니다. 시뮬레이션 결과는 ASP 알고리즘이 시스템 활용도와 공정성을 높이는 것으로 나타났습니다. 종단 간 접근 방식을 사용하여 확장된 최대 반송파 대 간섭 비율(Max C/I) 및 비례 공평성(PF) 스케줄링 알고리즘은 링크 기반 접근 방식을 사용하는 것보다 더 높은 처리량을 얻지만 더 많은 오버헤드가 발생합니다. BS와 RS 사이의 정보 교환을 위해. ASP와 end-to-end PF 스케줄링을 사용하는 자원 할당 방식은 시스템 처리량 극대화와 공정성 간의 균형을 달성합니다.
OFDMA 중계 시스템, 자원 할당, 패킷 스케줄링, 처리량, 공평
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.
부
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
부
@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},}
부
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 -