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
Cet article propose un algorithme d'allocation de ressources (RA) maximisé à efficacité énergétique (EE) dans les réseaux de liaison descendante à accès multiple par répartition orthogonale de la fréquence (OFDMA) avec plusieurs relais, où un nouveau protocole de décodage et de transfert (DF) basé sur une paire de sous-porteuses opportunistes avec formation de faisceau est utilisé. Concrètement, chaque transmission de données s'effectue dans deux tranches de temps consécutives. Lors de chaque transmission, plusieurs chemins parallèles, y compris des chemins relayés et des chemins directs, sont établis par l'algorithme RA proposé. En ce qui concerne le protocole, chaque sous-porteuse du 1er emplacement peut être associée à n'importe quelle sous-porteuse du 2ème emplacement pour utiliser au mieux les ressources de la sous-porteuse. De plus, pour chaque chemin relayé, plusieurs relais (pas seulement un seul ou tous) peuvent être choisis pour appliquer la formation de faisceau au niveau de la sous-porteuse du 2ème emplacement. Chaque chemin direct est construit par une sous-porteuse non appariée dans le 1er ou le 2ème emplacement. Afin de garantir une efficacité spectrale acceptable, nous introduisons également une contrainte de débit minimum. Le problème EE-maximisé est un problème d'optimisation hautement non linéaire, qui contient à la fois des variables continues et discrètes et a une structure fractionnaire. Pour résoudre le problème, le meilleur ensemble de relais et l'allocation de ressources pour un chemin relayé sont d'abord dérivés, puis nous concevons un algorithme itératif pour trouver le RA optimal pour le réseau. Enfin, des expériences numériques sont réalisées pour démontrer l'efficacité de l'algorithme proposé et montrer l'impact de l'exigence de débit minimum, du nombre d'utilisateurs et de la puissance du circuit sur le réseau 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.
Copier
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
Copier
@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},}
Copier
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 -