Algorithms for joint subcarrier pairing and power allocation are investigated in order to maximize the worst-case energy efficiency (EE) in dual-hop decode-and-forward (DF) relay networks in the presence of an… Click to show full abstract
Algorithms for joint subcarrier pairing and power allocation are investigated in order to maximize the worst-case energy efficiency (EE) in dual-hop decode-and-forward (DF) relay networks in the presence of an active eavesdropper. Accordingly, we study the impact of number of subcarriers on the trade-off in performance between the EE and the spectrum efficiency (SE). The formulated EE optimization problem is the ratio of the secure SE over the entire power consumption in the network, subject to the constraints of total transmit power and subcarrier pairing. A near-optimal iterative algorithm is proposed to perform the subcarrier pairing and power allocation for achieving the maximum EE in the networks. Furthermore, a suboptimal algorithm is proposed with two-step resource allocation. By considering the subcarrier channel quality of the source-to-relay and relay-to-destination links, the subcarrier pairing is first performed, followed by an energy-efficient iterative power allocation scheme to maximize the EE. Numerical results validate the effectiveness and correctness of the proposed algorithms.
               
Click one of the above tabs to view related content.