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(직교 주파수 분할 다중 접속) 다운링크 네트워크에서 에너지 효율(EE) 최대화 자원 할당(RA) 알고리즘을 제안합니다. 여기서 빔포밍을 사용하는 새로운 기회적 부반송파 쌍 기반 디코드 및 전달(DF) 프로토콜은 다음과 같습니다. 사용된. 특히, 모든 데이터 전송은 두 개의 연속된 시간 슬롯에서 수행됩니다. 모든 전송 동안 제안된 RA 알고리즘에 의해 중계 경로와 직접 경로를 포함한 다중 병렬 경로가 설정됩니다. 프로토콜의 경우 첫 번째 슬롯의 각 하위 캐리어는 두 번째 슬롯의 모든 하위 캐리어와 쌍을 이루어 하위 캐리어 리소스를 최대한 활용할 수 있습니다. 또한 각 중계 경로에 대해 두 번째 슬롯의 하위 반송파에 빔 형성을 적용하기 위해 여러(단일 또는 전체가 아닌) 중계를 선택할 수 있습니다. 각 직접 경로는 첫 번째 또는 두 번째 슬롯에 있는 페어링되지 않은 부반송파에 의해 구성됩니다. 허용 가능한 스펙트럼 효율성을 보장하기 위해 최소 속도 제한도 도입합니다. EE 최대화 문제는 연속형, 이산형 변수를 모두 포함하고 분수 구조를 갖는 매우 비선형적인 최적화 문제입니다. 문제를 해결하기 위해 먼저 릴레이 경로에 대한 최상의 릴레이 세트와 자원 할당을 도출한 다음 네트워크에 대한 최적의 RA를 찾기 위한 반복 알고리즘을 설계합니다. 마지막으로 제안된 알고리즘의 효율성을 입증하고 최소 속도 요구 사항, 사용자 수 및 네트워크 EE에 대한 회로 전력의 영향을 보여주기 위해 수치 실험을 수행합니다.
Tao WANG
Shanghai University
Mingfang WANG
Shanghai University
Yating WU
Shanghai University
Yanzan SUN
Shanghai University
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.
부
Tao WANG, Mingfang WANG, Yating WU, Yanzan SUN, "Green Resource Allocation in OFDMA Networks with Opportunistic Beamforming-Based DF Relaying" in IEICE TRANSACTIONS on Communications,
vol. E102-B, no. 8, pp. 1715-1727, August 2019, doi: 10.1587/transcom.2018EBP3169.
Abstract: This paper proposes an energy efficiency (EE) maximized resource allocation (RA) algorithm in orthogonal frequency division multiple access (OFDMA) downlink networks with multiple relays, where a novel opportunistic subcarrier pair based decode-and-forward (DF) protocol with beamforming is used. Specifically, every data transmission is carried out in two consecutive time slots. During every transmission, multiple parallel paths, including relayed paths and direct paths, are established by the proposed RA algorithm. As for the protocol, each subcarrier in the 1st slot can be paired with any subcarrier in 2nd slot to best utilize subcarrier resources. Furthermore, for each relayed path, multiple (not just single or all) relays can be chosen to apply beamforming at the subcarrier in the 2nd slot. Each direct path is constructed by an unpaired subcarrier in either the 1st or 2nd slot. In order to guarantee an acceptable spectrum efficiency, we also introduce a minimum rate constraint. The EE-maximized problem is a highly nonlinear optimization problem, which contains both continuous, discrete variables and has a fractional structure. To solve the problem, the best relay set and resource allocation for a relayed path are derived first, then we design an iterative algorithm to find the optimal RA for the network. Finally, numerical experiments are taken to demonstrate the effectiveness of the proposed algorithm, and show the impact of minimum rate requirement, user number and circuit power on the network EE.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EBP3169/_p
부
@ARTICLE{e102-b_8_1715,
author={Tao WANG, Mingfang WANG, Yating WU, Yanzan SUN, },
journal={IEICE TRANSACTIONS on Communications},
title={Green Resource Allocation in OFDMA Networks with Opportunistic Beamforming-Based DF Relaying},
year={2019},
volume={E102-B},
number={8},
pages={1715-1727},
abstract={This paper proposes an energy efficiency (EE) maximized resource allocation (RA) algorithm in orthogonal frequency division multiple access (OFDMA) downlink networks with multiple relays, where a novel opportunistic subcarrier pair based decode-and-forward (DF) protocol with beamforming is used. Specifically, every data transmission is carried out in two consecutive time slots. During every transmission, multiple parallel paths, including relayed paths and direct paths, are established by the proposed RA algorithm. As for the protocol, each subcarrier in the 1st slot can be paired with any subcarrier in 2nd slot to best utilize subcarrier resources. Furthermore, for each relayed path, multiple (not just single or all) relays can be chosen to apply beamforming at the subcarrier in the 2nd slot. Each direct path is constructed by an unpaired subcarrier in either the 1st or 2nd slot. In order to guarantee an acceptable spectrum efficiency, we also introduce a minimum rate constraint. The EE-maximized problem is a highly nonlinear optimization problem, which contains both continuous, discrete variables and has a fractional structure. To solve the problem, the best relay set and resource allocation for a relayed path are derived first, then we design an iterative algorithm to find the optimal RA for the network. Finally, numerical experiments are taken to demonstrate the effectiveness of the proposed algorithm, and show the impact of minimum rate requirement, user number and circuit power on the network EE.},
keywords={},
doi={10.1587/transcom.2018EBP3169},
ISSN={1745-1345},
month={August},}
부
TY - JOUR
TI - Green Resource Allocation in OFDMA Networks with Opportunistic Beamforming-Based DF Relaying
T2 - IEICE TRANSACTIONS on Communications
SP - 1715
EP - 1727
AU - Tao WANG
AU - Mingfang WANG
AU - Yating WU
AU - Yanzan SUN
PY - 2019
DO - 10.1587/transcom.2018EBP3169
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2019
AB - This paper proposes an energy efficiency (EE) maximized resource allocation (RA) algorithm in orthogonal frequency division multiple access (OFDMA) downlink networks with multiple relays, where a novel opportunistic subcarrier pair based decode-and-forward (DF) protocol with beamforming is used. Specifically, every data transmission is carried out in two consecutive time slots. During every transmission, multiple parallel paths, including relayed paths and direct paths, are established by the proposed RA algorithm. As for the protocol, each subcarrier in the 1st slot can be paired with any subcarrier in 2nd slot to best utilize subcarrier resources. Furthermore, for each relayed path, multiple (not just single or all) relays can be chosen to apply beamforming at the subcarrier in the 2nd slot. Each direct path is constructed by an unpaired subcarrier in either the 1st or 2nd slot. In order to guarantee an acceptable spectrum efficiency, we also introduce a minimum rate constraint. The EE-maximized problem is a highly nonlinear optimization problem, which contains both continuous, discrete variables and has a fractional structure. To solve the problem, the best relay set and resource allocation for a relayed path are derived first, then we design an iterative algorithm to find the optimal RA for the network. Finally, numerical experiments are taken to demonstrate the effectiveness of the proposed algorithm, and show the impact of minimum rate requirement, user number and circuit power on the network EE.
ER -