1,365 research outputs found
On the optimization of distributed compression in multirelay cooperative networks
In this paper, we consider multirelay cooperative networks for the Rayleigh fading channel, where each relay, upon receiving its own channel observation, independently compresses it and forwards the compressed information to the destination. Although the compression at each relay is distributed using Wyner-Ziv coding, there exists an opportunity for jointly optimizing compression at multiple relays to maximize the achievable rate. Considering Gaussian signaling, a primal optimization problem is formulated accordingly. We prove that the primal problem can be solved by resorting to its Lagrangian dual problem, and an iterative optimization algorithm is proposed. The analysis is further extended to a hybrid scheme, where the employed forwarding scheme depends on the decoding status of each relay. The relays that are capable of successful decoding perform a decode-and-forward (DF) scheme, and the rest conduct distributed compression. The hybrid scheme allows the cooperative network to adapt to the changes of the channel conditions and benefit from an enhanced level of flexibility. Numerical results from both spectrum and energy efficiency perspectives show that the joint optimization improves efficiency of compression and identify the scenarios where the proposed schemes outperform the conventional forwarding schemes. The findings provide important insights into the optimal deployment of relays in a realistic cellular network
Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks
The problem of optimal power allocation among the relays in a two-hop
decode-and-forward cooperative relay network with independent Rayleigh fading
channels is considered. It is assumed that only the relays that decode the
source message correctly contribute in data transmission. Moreover, only the
knowledge of statistical channel state information is available. A new simple
closed-form expression for the average symbol error probability is derived.
Based on this expression, a new power allocation method that minimizes the
average symbol error probability and takes into account the constraints on the
total average power of all the relay nodes and maximum instant power of each
relay node is developed. The corresponding optimization problem is shown to be
a convex problem that can be solved using interior point methods. However, an
approximate closed-form solution is obtained and shown to be practically more
appealing due to significant complexity reduction. The accuracy of the
approximation is discussed. Moreover, the so obtained closed-form solution
gives additional insights into the optimal power allocation problem. Simulation
results confirm the improved performance of the proposed power allocation
scheme as compared to other schemes.Comment: 27 pages, 5 figures, submitted to the IEEE Trans. Signal Processing
in Feb. 201
- …