Optimal power allocation for a full-duplex multicarrier decode-forward relay system with or without direct link

In this paper, we propose an optimal time and power allocation scheme in a wireless power supply full-duplex (FD) relay system, where we consider the number of relay antennas in the energy harvesting stage. At the same time, the energy efficiency optimization problem of the system is structured, where optimization issues related to time allocation factors and power allocation are established. For the FD dual-antenna and the FD single-antenna energy harvesting system, energy efficiency function is proven to be a concave function over the time-switch factor, and the optimal time-switching factor is theoretically obtained using the Lambert function. Then, according to the given value range of the optimal time switching factor, the optimal power distribution scheme is obtained by analyzing the derivative function of the system energy efficiency and using the properties of the Lambert function. The time-switching factor and transmission power are optimally selected at the wireless power supply FD relay. Results reveal that the performance of energy efficiency of the dual-antenna energy harvesting at the FD relay outperforms that of the single-antenna. Moreover, our results demonstrate that FD relay systems always substantially boost the energy efficiency compared with half-duplex (HD) relay systems.

This paper investigates the optimal precoder design and power allocation between the source and relay for a half-duplex single-relay non-orthogonal amplify-and-forward (NAF) system. Based on the pair-wise error probability (PEP) analysis, an optimal class of 2 × 2 precoders is first derived for the traditional power allocation scheme, where one-third of the system power is spent at the relay node, while two-thirds are spent at the source node. Different from optimal unitary precoders proposed earlier, the derived class of precoders indicates that the source should spend all its power transmitting a superposition of the symbols in the broadcast phase, while being silent in the cooperative phase, for optimal asymptotic performance. We then further address the problem of jointly optimal precoder and power allocation for the system under consideration. It is shown that the total power should be equally distributed to the source and the relay, and the source should again spend no power during the cooperative phase for the best asymptotic performance. Analytical and simulation results reveal that the proposed precoders not only exploit full cooperative diversity, but also provide significant coding gain over the optimal unitary precoders. For instance, a coding gain of around 1dB can be attained at the practical BER level of 10 − 5 for various modulation schemes.

For data services over satellite networks, the efficient management of satellite downlink communication resources is crucial for economic competitiveness of the medium. To support a broad spectrum of users with small terminals at high rates, narrow transmit spotbeams on the satellite will be used. Since satellite transmitter resources are expensive and there can be many spotbeam-coverage cells within the satellite service area, it is attractive to use some form of agile scanning beam system and to time-share these precious resources. An optimized design of the multibeam antenna pattern and scheduling can further improve the efficiency of transmission and power management. In this paper, the advantage of parallel multibeams in terms of spectral efficiency and power gain is shown, and the issue of multibeam power allocation based on traffic demands and channel conditions over satellite downlinks with power and delay constraints is addressed. The study indicates that the use of a parallel multibeam scheme with optimum power allocation can achieve a substantial power gain and reasonable proportional fairness. By coupling power allocation with multibeam scheduling when the number of active beams is smaller than the number of cells, the authors show that a modest number of active parallel beams are sufficient to cover many cells efficiently.

This paper investigates the power allocation between the cognitive transmitter (CT) and the cognitive relay (CR) in a cognitive Amplify-and-Forward (AF) full-duplex relay network. To maximize the cognitive capacity, we firstly obtain a closed form expression of the optimal power allocation with the instantaneous interference channel information. Then considering limited cooperation between the primary and the cognitive networks, we develop an efficient iterative search algorithm to obtain the optimal power allocation with the statistical rather than the instantaneous interference channel information. Furthermore, considering absolutely no cooperation between the primary and the cognitive networks, we develop a sensing-based iterative search algorithm to obtain the optimal power allocation without any interference channel information. Simulation results show the capacity of the cognitive AF full-duplex relay network may achieve up to 50% improvement compared with the cognitive AF half-duplex relay network on the condition that the mean value of the self-interference channel gain is lower than −25 dB.

In this paper, we propose a dynamic power allocation scheme for a single-relay network based on orthogonal frequency division multiplexing (OFDM) modulation with limited feedback.We consider an Amplify-and-Forward (AF) cooperative diversity model, where one source node communicates with one destination node assisted by one half duplex relay. The power allocation scheme employs a codebook of quantized power allocation vectors designed offline equipped on the source, relay, and destination. The destination, who has full knowledge of channel state information (CSI), chooses the best power allocation vector and sends back its index to the source and relay nodes, which results in a dramatic reduced overhead over conventional resource allocation. First we achieve the optimal power allocation solution as the function of channel realizations with maximum capacity. Then we present an adaptation of the Lloyd algorithm to construct a codebook to quantize the optimal power allocation vectors subject to the amount of feedback. Simulations show that a negligible performance loss could be achieved with just a few feedback bits at different levels of SNRs.

This paper considers the wiretap channel in which a source node communicates with a destination node with the aid of a single helper and in the presence of an eavesdropper. The helper can apply either amplify-and-forward (AF) relaying or jamming. The secrecy capacity and respective optimal power allocation schemes at the source and the helper are investigated under both individual and joint power constraints. Given that the links among the nodes might not always be available for transmission (e.g., due to heavy shadowing), several network topologies are considered for relaying. To deal with the related nonconcave optimization problems in solving the optimal power allocation schemes, we first propose an analytical approach based on Descartes' rule of signs. Using this approach, optimal power allocation strategies are derived for some relay topologies and for the jamming system. Insights into the proposed schemes for different transmission power ranges and comparisons to the optimal information rate power allocations are also discussed. Simulation results are finally provided to quantify the optimality of the proposed schemes.

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> We consider a general multiple-antenna network with multiple sources, multiple destinations, and multiple relays in terms of the diversity–multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into account the processing capability of the relays (half-duplex or full-duplex), and the network geometry (clustered or nonclustered). We first study the multiple-antenna relay channel with a full-duplex relay to understand the effect of increased degrees of freedom in the direct link. We find DMT upper bounds and investigate the achievable performance of decode-and-forward (DF), and compress-and-forward (CF) protocols. Our results suggest that while DF is DMT optimal when all terminals have one antenna each, it may not maintain its good performance when the degrees of freedom in the direct link are increased, whereas CF continues to perform optimally. We also study the multiple-antenna relay channel with a half-duplex relay. We show that the half-duplex DMT behavior can significantly be different from the full-duplex case. We find that CF is DMT optimal for half-duplex relaying as well, and is the first protocol known to achieve the half-duplex relay DMT. We next study the multiple-access relay channel (MARC) DMT. Finally, we investigate a system with a single source–destination pair and multiple relays, each node with a single antenna, and show that even under the ideal assumption of full-duplex relays and a clustered network, this virtual multiple-input multiple-output (MIMO) system can never fully mimic a real MIMO DMT. For cooperative systems with multiple sources and multiple destinations the same limitation remains in effect. </para>

Power and code allocation across two adjacent cells is studied for the downlink of a code-division multiple-access voice network. Each user has a utility function that measures the user's willingness to pay, or utility, as a function of the received signal-to-interference-plus-noise-ratio. The objective is to maximize the total utility over the two cells subject to code and power constraints. When all active users receive the same utility, the optimal allocation is characterized by a pair of threshold radii for the two cells, where each radius specifies the set of active users in that cell. The behavior of the optimal radii are characterized as a function of load and available resources (power and codes). The corresponding optimal power allocation can be achieved through a pricing scheme, in which each base station announces a price for each resource, and each user responds by requesting the amount of resources that maximizes the user's surplus (utility minus cost). We show that, depending on the load and resource constraints, the two cells may have to coordinate, or exchange information, in order to maximize the total utility.

In this paper, we investigate the fading two-hop full-duplex (FD) relay channel with self- interference, which is comprised of a source, an FD relay impaired by self-interference, and a destination, where a direct source-destination link does not exist. For this channel, we propose two buffer-aided relaying schemes with adaptive reception-transmission at the FD relay for the cases when the source and the relay both perform adaptive-rate and fixed-rate transmission, respectively. The proposed buffer-aided relaying schemes enable the FD relay to adaptively select to either receive, transmit, or simultaneously receive and transmit in a given time slot based on the qualities of the receiving, transmitting, and self-interference channels; a degree-of-freedom unavailable without buffer-aided relaying. Our numerical results show that significant performance gains are achieved using the proposed buffer-aided relaying schemes compared to conventional FD relaying, where the FD relay is forced to always simultaneously receive and transmit, and to buffer-aided half-duplex relaying, where the half-duplex relay cannot simultaneously receive and transmit. The main conclusion of this work is that FD relaying systems without buffer-aided relaying miss-out on significant performance gains.

To improve the bandwidth efficiency, a semi-blind channel estimation method using data nulling superimposed pilots (DNSP) is designed for orthogonal frequency division multiplexing (OFDM) system without data rate loss. However, the data distortion is introduced by rank-deficient precoding. To minimize the data distortion, the optimal precoder is found to minimize the Euclidean distance between precoded sequence and source sequence. Further, the impact of power allocation between training sequence and data information on effective signal noise ratio (SNR) is analytically derived, effective SNR is found to be a quadratic function for the percentage allocated for training sequence, and the optimal power allocation is provided to maximize the effective SNR. Simulation results show that our optimal precoder design and power allocation scheme obtain the optimal performance of symbol detection.

This paper presents an optimal energy-efficient power allocation scheme for a point-to-point multicarrier link over frequency-selective fading channel subject to a delay-outage probability constraint. For a target delay-outage limit, the energy efficiency (EE) objective function is formulated as the ratio of the achieved link effective capacity to the total expenditure power, expressed in units of b/J/Hz. We first prove that this objective function is quasi-concave in the transmission power, and, hence, the global maximum solution of the underlying optimization problem can be obtained using fractional programming. Subsequently, we develop a two-step optimal power allocation algorithm by first obtaining the average sum power level corresponding to the maximum achievable EE, followed by jointly distributing this obtained average power over time and frequency. Analytical results show that the EE-based power allocation has a structure similar to that of the QoS-driven spectral-efficient scheme, but with a different cut-off threshold below which no transmission power is allocated. Simulation results show that the proposed joint optimal power allocation scheme provides significant EE gains over the simple independent subcarrier optimization scheme, where these performance advantages become more pronounced with tighter delay constraints and in fading channels with more severe frequency selectivity.

In this paper, the performance of dual-hop multiple-input multiple-output (MIMO) relay system with transmit beamforming and maximum-ratio combining scheme (MIMO-MRC) for each hop is investigated. Both the relay and destination are subjected to multiple co-channel interferences (CCIs). An exact closed-form outage probability expression is derived for the Rayleigh fading channels. Then, to render more insights into the combined effects of multiple antennas and CCIs, the asymptotic behavior of the outage probability is also presented and discussed. Based on the asymptotic expressions, we explicitly characterize the system diversity order. The results show that the diversity order is essentially directly proportional to the number of antennas at the relay. Furthermore, employing both exact optimal power allocation (OPA) and asymptotic OPA methods, we determine the optimal power allocation (OPA) such that the outage probability is minimized. We show that OPA offers superior performance over uniform power allocation, and highlight a pivotal design choice for maximizing system performance without investing additional resources.

This paper investigates an unmanned aerial vehicle (UAV) enabled full-duplex relaying system. By assuming that the UAV follows a circular trajectory and applies decode-and-forward relaying strategy, we study the joint design of beamforming and power allocation to maximize the instantaneous data rate, under both the individual and the sum power constraints over the source and relay nodes. As the problem is non-convex, we propose an efficient sub-optimal solution based on block-coordinate descent method by decomposing the problem into two sub-problems: a beamforming optimization sub-problem with given power allocation and a power allocation sub-problem with fixed beamforming. For the beamforming design sub-problem, the optimal solution is obtained based on the semi-definite relaxation technique. For the power allocation sub-problem, the optimal solution is obtained in closed form. Then, the closed-form cumulative distribution function and outage probability expressions for sub-optimal beamforming with both uniform power allocation and optimal power allocation are derived. In addition, simple and informative high signal-to-noise ratio (SNR) approximations for outage probability expressions are presented to gain insights. Finally, the optimal flying altitude that minimizes the average outage probability is obtained via one-dimensional search.

Multicarrier transmission is an established technique for radio transmission systems and it can be considered as a promising approach for next generation wireless systems. In channel situations with high delay-spreads, OFDM requires large guard interval lengths which decrease the spectral efficiency significantly. Therefore, alternative multicarrier transmission systems are of great practical interest, which guarantee a reliable transmission without a guard interval. In multicarrier systems the subcarriers are weighted in a quite different way by the frequency selective channel, based on the inherent structure of the multicarrier transmission system. If the transmitter knows the channel, the subchannel's transmission parameters such as transmit power or modulation alphabets can be adapted. In this contribution, transmit power allocation schemes for BER performance improvements in a wavelet-based multicarrier transmission system with SVD equalization (singular value decomposition) are investigated under the constraints of a limited total transmit power and a given data rate. Thereby the differences between the optimal but highly complex solution and suboptimal but complexity-reduced solutions are analyzed. Numerical results are obtained by simulations assuming different time-variant channel characteristics, with delays larger than the multicarrier symbol duration.

In this paper, we consider an amplify-and-forward wireless relay system where multiple source nodes communicate with their corresponding destination nodes with the help of relay nodes. Conventionally, each relay equally distributes the available resources to its relayed sources. This approach is clearly sub-optimal since each user experiences dissimilar channel conditions, and thus, demands different amount of allocated resources to meet its quality-of-service (QoS) request. Therefore, this paper presents novel power allocation schemes to i) maximize the minimum signal-to-noise ratio among all users; ii) minimize the maximum transmit power over all sources; iii) maximize the network throughput. Moreover, due to limited power, it may be impossible to satisfy the QoS requirement for every user. Consequently, an admission control algorithm should first be carried out to maximize the number of users possibly served. Then, optimal power allocation is performed. Although the joint optimal admission control and power allocation problem is combinatorially hard, we develop an effective heuristic algorithm with significantly reduced complexity. Even though theoretically sub-optimal, it performs remarkably well. The proposed power allocation problems are formulated using geometric programming (GP), a well-studied class of nonlinear and nonconvex optimization. Since a GP problem is readily transformed into an equivalent convex optimization problem, optimal solution can be obtained efficiently. Numerical results demonstrate the effectiveness of our proposed approach.