High performance static and dynamic cooperative communication protocols for the half duplex fading relay channel

Prasad, Narayan; Varanasi, Mahesh K.

doi:10.1109/twc.2010.01.090473

Cited by 26 publications

(25 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The fact that DDF is optimal for small multiplexing gains and QMF with a fixed schedule is optimal for large multiplexing gains is qualitatively similar to the case when the relay is equipped with multiple antennas but with identical fading for each link [12], [13]. However, the two settings and the resultant trade-offs are quite different.…”

Section: Introductionmentioning

confidence: 77%

When Are Dynamic Relaying Strategies Necessary in Half-Duplex Wireless Networks?

Kolte

Özgür

Diggavi

2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-In this paper we study a simple question: when are dynamic relaying strategies essential in optimizing the diversitymultiplexing tradeoff (DMT) in half-duplex wireless relay networks? This is motivated by apparently two contrasting results even for a simple 3 node network, with a single half-duplex relay. When all channels in the system are assumed to be independent and identically fading, a static schedule where the relay listens half the time and transmits half the time combined with quantizemap-and-forward (QMF) relaying is known to achieve the fullduplex performance. However, when there is no direct link between the source and the destination, a dynamic decodeand-forward (DDF) strategy is needed to achieve the optimal tradeoff. In this case, a static schedule is strictly suboptimal and the optimal tradeoff is significantly worse than the fullduplex performance. In this paper we study the general case when the direct link is neither as strong as the other links nor fully non-existent, and identify regimes where dynamic schedules are necessary and those where static schedules are enough. We identify four qualitatively different regimes for the single relay channel where the tradeoff between diversity and multiplexing is significantly different. We show that in all these regimes one of the above two strategies is sufficient to achieve the optimal tradeoff by developing a new upper bound on the best achievable tradeoff under channel state information available only at the receivers. A natural next question is whether these two strategies are sufficient to achieve the DMT of more general half-duplex wireless networks with a larger number of relays. We propose a generalization of the two existing schemes through a dynamic QMF strategy, where the relay listens for a fraction of time depending on received CSI but not long enough to be able to decode. We show that such a dynamic QMF (DQMF) strategy is needed to achieve the optimal DMT in a parallel channel with two relays, outperforming both DDF and static QMF strategies.

show abstract

Section: Introductionmentioning

confidence: 77%

When Are Dynamic Relaying Strategies Necessary in Half-Duplex Wireless Networks?

Kolte

Özgür

Diggavi

2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…While two-hop cooperative relay networks have been stud ied in considerable detail in the literature, (see for example, [4]- [8], [17]- [19], [27]- [31]), in terms of the DMT, few results are available for more general networks. Yang and Belfiore in [33] consider Amplify-and-Forward (AF) protocols for a family of MIMO multi-hop networks (which are termed as multi-antenna layered networks in the current paper).…”

Section: A Prior Workmentioning

confidence: 99%

DMT of multi-hop cooperative networks

Sreeram

Birenjith²,

Kumar

2010

IEEE Information Theory Workshop 2010 (ITW 2010)

View full text Add to dashboard Cite

Some basic results that help in determining the Diversity-Multiplexing Tradeoff (DMT) of cooperative multihop networks are first identified. As examples, the maximum achiev able diversity gain is shown to equal the min-cut between source and sink, whereas the maximal multiplexing gain is shown to equal the minimum rank of the matrix characterizing the MIMO channel appearing across a cut in the network.Two multi-hop generalizations of the two-hop network are then considered, namely layered networks as well as a class of networks introduced here and termed as K -parallel-path (KPP) networks. The DMT of KPP networks is characterized for K > 3.It is shown that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for fully-connected, layered networks. Explicit coding schemes achieving the DMT that make use of cyclic-division-algebra-based distributed space-time codes underlie the above results.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple, amplify and-forward protocols are often sufficient to attain the optimal DMT. I. IN TRODUCTIONWe present an overview of the results contained in [1], [2]. The setting for these results is a single-source, single-sink (ss ss) wireless network where each link experiences Rayleigh fading and where the additive noise on each link is CN(O, 1).The focus is on performance as measured by the diversity multiplexing tradeoff (DMT).The results are of two kinds: basic results that apply to such networks in general as well as results that provide information about the DMT of specific classes of networks. A. Prior Work While two-hop cooperative relay networks have been stud ied in considerable detail in the literature, (see for example, [4]-[8], [17]-[19], [27]-[31]), in terms of the DMT, few results are available for more general networks. Yang and Belfiore in [33]consider Amplify-and-Forward (AF) protocols for a family of MIMO multi-hop networks (which are termed as multi-antenna layered networks in the current paper). They derive the optimal DMT for the Rayleigh-product channel which they prove is equal to the DMT of the AF protocol applied to this channel. They also propose AF protocols to achieve the optimal diversity of these multi-antenna layered networks.Oggier and Hassibi [23] have proposed distributed space time codes for multi-antenna layered networks that achieve diversity gain equal to the minimum number of relay nodes among the hops. Vaze and Heath [24] construct distributed space time codes based on orthogonal designs that achieve the optimal diversity of the multi-antenna layered network. In [25], the same authors study the question of the circumstances under which coding is required to achieve full diversity in a layered network.Borade, Zheng and Gallager in [26] consider AF schemes on a class of multi-hop layered networks where each layer has the same number of relays (termed as regular networks in the curr...

show abstract

“…In addition, most of the work assumes static and equal time durations for source to relay and relay to destination transmissions in the DF relay. However, [21], [22] shows that the DF relay with dynamic time durations which are dependent on the channels, outperforms the static case. The diversity order and the sum information rate of dynamic DF relays are calculated in [23].…”

Section: Introductionmentioning

confidence: 98%

Resource Allocation in Dynamic DF Relay for SWIPT Network with Circuit Power Consumption

Pilanawithana

Atapattu

Evans

2019

2019 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

This paper considers simultaneous wireless information and power transfer (SWIPT) over a dual-hop dynamic decode-and-forward (DF) relay network with the power-splitting (PS) energy harvesting protocol at the relay. The circuit power consumption (CPC), which includes power requirements for both decoding and encoding circuits, is considered at the relay. For a rate-dependent linear CPC model, we formulate an optimization problem to decide the optimal throughput, PS ratio, relay transmit power and time ratio for the source to relay transmission. Although the resultant optimization problem is nonconvex, we derive an efficient optimization algorithm, requiring significantly less floating point operations than an interior point method. Finally, we present numerical results which lead to some interesting insights for system design.Index Terms-Circuit power consumption, dynamic decodeand-forward relay, wireless energy transfer.

show abstract

High performance static and dynamic cooperative communication protocols for the half duplex fading relay channel

Cited by 26 publications

References 20 publications

When Are Dynamic Relaying Strategies Necessary in Half-Duplex Wireless Networks?

When Are Dynamic Relaying Strategies Necessary in Half-Duplex Wireless Networks?

DMT of multi-hop cooperative networks

Resource Allocation in Dynamic DF Relay for SWIPT Network with Circuit Power Consumption

Contact Info

Product

Resources

About