2,578 research outputs found
On Capacity and Optimal Scheduling for the Half-Duplex Multiple-Relay Channel
We study the half-duplex multiple-relay channel (HD-MRC) where every node can
either transmit or listen but cannot do both at the same time. We obtain a
capacity upper bound based on a max-flow min-cut argument and achievable
transmission rates based on the decode-forward (DF) coding strategy, for both
the discrete memoryless HD-MRC and the phase-fading HD-MRC. We discover that
both the upper bound and the achievable rates are functions of the
transmit/listen state (a description of which nodes transmit and which
receive). More precisely, they are functions of the time fraction of the
different states, which we term a schedule. We formulate the optimal scheduling
problem to find an optimal schedule that maximizes the DF rate. The optimal
scheduling problem turns out to be a maximin optimization, for which we propose
an algorithmic solution. We demonstrate our approach on a four-node
multiple-relay channel, obtaining closed-form solutions in certain scenarios.
Furthermore, we show that for the received signal-to-noise ratio degraded
phase-fading HD-MRC, the optimal scheduling problem can be simplified to a max
optimization.Comment: Author's final version (to appear in IEEE Transactions on Information
Theory
Cooperative Multiplexing in the Multiple Antenna Half Duplex Relay Channel
Cooperation between terminals has been proposed to improve the reliability
and throughput of wireless communication. While recent work has shown that
relay cooperation provides increased diversity, increased multiplexing gain
over that offered by direct link has largely been unexplored. In this work we
show that cooperative multiplexing gain can be achieved by using a half duplex
relay. We capture relative distances between terminals in the high SNR
diversity multiplexing tradeoff (DMT) framework. The DMT performance is then
characterized for a network having a single antenna half-duplex relay between a
single-antenna source and two-antenna destination. Our results show that the
achievable multiplexing gain using cooperation can be greater than that of the
direct link and is a function of the relative distance between source and relay
compared to the destination. Moreover, for multiplexing gains less than 1, a
simple scheme of the relay listening 1/3 of the time and transmitting 2/3 of
the time can achieve the 2 by 2 MIMO DMT.Comment: 5 pages, 5 figures submitted to ISIT 200
Capacity region of the deterministic multi-pair bi-directional relay network
In this paper we study the capacity region of the multi-pair bidirectional
(or two-way) wireless relay network, in which a relay node facilitates the
communication between multiple pairs of users. This network is a generalization
of the well known bidirectional relay channel, where we have only one pair of
users. We examine this problem in the context of the deterministic channel
interaction model, which eliminates the channel noise and allows us to focus on
the interaction between signals. We characterize the capacity region of this
network when the relay is operating at either full-duplex mode or half-duplex
mode (with non adaptive listen-transmit scheduling). In both cases we show that
the cut-set upper bound is tight and, quite interestingly, the capacity region
is achieved by a simple equation-forwarding strategy.Comment: Will be presented in the 2009 IEEE Information Theory Workshop on
Networking and Information Theor
Optimal Scheduling and Power Allocation for Two-Hop Energy Harvesting Communication Systems
Energy harvesting (EH) has recently emerged as a promising technique for
green communications. To realize its potential, communication protocols need to
be redesigned to combat the randomness of the harvested energy. In this paper,
we investigate how to apply relaying to improve the short-term performance of
EH communication systems. With an EH source and a non-EH half-duplex relay, we
consider two different design objectives: 1) short-term throughput
maximization; and 2) transmission completion time minimization. Both problems
are joint scheduling and power allocation problems, rendered quite challenging
by the half-duplex constraint at the relay. A key finding is that directional
water-filling (DWF), which is the optimal power allocation algorithm for the
single-hop EH system, can serve as guideline for the design of two-hop
communication systems, as it not only determines the value of the optimal
performance, but also forms the basis to derive optimal solutions for both
design problems. Based on a relaxed energy profile along with the DWF
algorithm, we derive key properties of the optimal solutions for both problems
and thereafter propose efficient algorithms. Simulation results will show that
both scheduling and power allocation optimizations are necessary in two-hop EH
communication systems.Comment: Submitted to IEEE Transaction on Wireless Communicatio
- …