4,369 research outputs found
Power Allocation in Relay Channels under a Global Power Constraint using Virtual Nodes
International audienceRelay channels have been extensively studied in the literature since the seminal paper by Cover and El Gamal. Nevertheless, characterizing the capacity of relay channels still presents open issues. While numerous works addressed this problem with constant powers or targeted the sum-rate optimization, computing the capacity in the case of a global power constraint was less studied. In this paper, we introduce the concept of virtual nodes to derive analytical expressions of the relay channel capacity as a function of the total power. This transformation leads to simple closed-form expressions of the upper bound and decode-and-forward (DF) lower bound on the capacity of the full- and half-duplex relay channels. The half-duplex study is separated into low and high signal-to-noise ratio (SNR) cases. The impact of these approximations is evaluated and found to achieve a large part of the maximal capacity in the worst case where the equivalent received SNR is neither low nor high, typically between 0-10dB
Jointly Optimal Channel and Power Assignment for Dual-Hop Multi-channel Multi-user Relaying
We consider the problem of jointly optimizing channel pairing, channel-user
assignment, and power allocation, to maximize the weighted sum-rate, in a
single-relay cooperative system with multiple channels and multiple users.
Common relaying strategies are considered, and transmission power constraints
are imposed on both individual transmitters and the aggregate over all
transmitters. The joint optimization problem naturally leads to a mixed-integer
program. Despite the general expectation that such problems are intractable, we
construct an efficient algorithm to find an optimal solution, which incurs
computational complexity that is polynomial in the number of channels and the
number of users. We further demonstrate through numerical experiments that the
jointly optimal solution can significantly improve system performance over its
suboptimal alternatives.Comment: This is the full version of a paper to appear in the IEEE Journal on
Selected Areas in Communications, Special Issue on Cooperative Networking -
Challenges and Applications (Part II), October 201
Joint Source and Relay Precoding Designs for MIMO Two-Way Relaying Based on MSE Criterion
Properly designed precoders can significantly improve the spectral efficiency
of multiple-input multiple-output (MIMO) relay systems. In this paper, we
investigate joint source and relay precoding design based on the
mean-square-error (MSE) criterion in MIMO two-way relay systems, where two
multi-antenna source nodes exchange information via a multi-antenna
amplify-and-forward relay node. This problem is non-convex and its optimal
solution remains unsolved. Aiming to find an efficient way to solve the
problem, we first decouple the primal problem into three tractable
sub-problems, and then propose an iterative precoding design algorithm based on
alternating optimization. The solution to each sub-problem is optimal and
unique, thus the convergence of the iterative algorithm is guaranteed.
Secondly, we propose a structured precoding design to lower the computational
complexity. The proposed precoding structure is able to parallelize the
channels in the multiple access (MAC) phase and broadcast (BC) phase. It thus
reduces the precoding design to a simple power allocation problem. Lastly, for
the special case where only a single data stream is transmitted from each
source node, we present a source-antenna-selection (SAS) based precoding design
algorithm. This algorithm selects only one antenna for transmission from each
source and thus requires lower signalling overhead. Comprehensive simulation is
conducted to evaluate the effectiveness of all the proposed precoding designs.Comment: 32 pages, 10 figure
MIMO-OFDM Based Energy Harvesting Cooperative Communications Using Coalitional Game Algorithm
This document is the Accepted Manuscript version. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In this paper, we consider the problem of cooperative communication between relays and base station in an advanced MIMO-OFDM framework, under the assumption that the relays are supplied by electric power drawn from energy harvesting (EH) sources. In particular, we focus on the relay selection, with the goal to guarantee the required performance in terms of capacity. In order to maximize the data throughput under the EH constraint, we model the transmission scheme as a non-transferable coalition formation game, with characteristic function based on an approximated capacity expression. Then, we introduce a powerful mathematical tool inherent to coalitional game theory, namely: the Shapley value (Sv) to provide a reliable solution concept to the game. The selected relays will form a virtual dynamically-configuredMIMO network that is able to transmit data to destination using efficient space-time coding techniques. Numerical results, obtained by simulating the EH-powered cooperativeMIMO-OFDMtransmission with Algebraic Space-Time Coding (ASTC), prove that the proposed coalitional game-based relay selection allows to achieve performance very close to that obtained by the same system operated by guaranteed power supply. The proposed methodology is finally compared with some recent related state-of-the-art techniques showing clear advantages in terms of link performance and goodput.Peer reviewe
- …