Green Resource Allocation in OFDMA Networks with Opportunistic Beamforming-Based DF Relaying

  • WANG Tao
    Shanghai Institute for Advanced Communication and Data Science, Key laboratory of Specialty Fiber Optics and Optical Access Networks, Joint International Research Laboratory of Specialty Fiber Optics and Advanced Communication, Shanghai University
  • WANG Mingfang
    Shanghai Institute for Advanced Communication and Data Science, Key laboratory of Specialty Fiber Optics and Optical Access Networks, Joint International Research Laboratory of Specialty Fiber Optics and Advanced Communication, Shanghai University
  • WU Yating
    Shanghai Institute for Advanced Communication and Data Science, Key laboratory of Specialty Fiber Optics and Optical Access Networks, Joint International Research Laboratory of Specialty Fiber Optics and Advanced Communication, Shanghai University
  • SUN Yanzan
    Shanghai Institute for Advanced Communication and Data Science, Key laboratory of Specialty Fiber Optics and Optical Access Networks, Joint International Research Laboratory of Specialty Fiber Optics and Advanced Communication, Shanghai University

この論文をさがす

説明

<p>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.</p>

収録刊行物

参考文献 (18)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ