DocumentCode :
61331
Title :
When Are Dynamic Relaying Strategies Necessary in Half-Duplex Wireless Networks?
Author :
Kolte, Ritesh ; Ozgur, Ayfer ; Diggavi, Suhas
Author_Institution :
Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
Volume :
61
Issue :
4
fYear :
2015
fDate :
Apr-15
Firstpage :
1720
Lastpage :
1738
Abstract :
In this paper, we study a simple question: when are dynamic relaying strategies essential in optimizing the diversity-multiplexing tradeoff (DMT) in half-duplex wireless relay networks? This is motivated by apparently two contrasting results even for a simple three-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 quantize-map-and-forward (QMF) relaying is known to achieve the full-duplex performance. However, when there is no direct link between the source and the destination, a dynamic decode-and-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 full-duplex performance. In this paper, we study the general case when the direct link is neither as strong as the other links nor fully nonexistent, 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 (DQMF) strategy, where the relay listens for a fraction of time depending on received channel state information but not long enough to be able to decode. We show that such a DQMF strategy is needed to achieve the optimal DMT in a paral- el channel with two relays, outperforming both DDF and static QMF strategies.
Keywords :
decode and forward communication; diversity reception; relay networks (telecommunication); scheduling; DDF strategy; DQMF strategy; QMF relaying; channel state information; diversity-multiplexing tradeoff; dynamic QMF strategy; dynamic decode-and-forward strategy; dynamic relaying strategy; dynamic schedules; half-duplex relay; half-duplex wireless networks; quantize-map-and-forward relaying; single-relay channel; static schedule; three-node network; Dynamic scheduling; Fading; Multiplexing; Relay networks (telecommunications); Schedules; Upper bound; Diversity-Multiplexing Tradeoff; Diversity-multiplexing tradeoff; Dynamic-Decode-Forward; Half-Duplex; Quantize-Map-Forward; Relay Networks; Relay scheduling; dynamic-decode-forward; half-duplex; quantize-map-forward; relay networks; relay scheduling;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2015.2402163
Filename :
7038186
Link To Document :
بازگشت