On Capacity and Optimal Scheduling for the Half-Duplex Multiple-Relay Channel

DOI10.1109/TIT.2012.2204489MaRDI QIDQ2989771zbMATH OpenOpenAlexWikidataFDO

Authors Lawrence Ong, Mehul Motani, Sarah J. Johnson

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1207.3850

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Channel models (including quantum) in information and communication theory (94A40)

Abstract: 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.

Recommendations

• Relay Scheduling in the Half-Duplex Gaussian Parallel Relay Channel
• On the Optimality of Simple Schedules for Networks With Multiple Half-Duplex Relays
• Opportunistic Scheduling of Randomly Coded Multicast Transmissions at Half-Duplex Relay Stations
• Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations
• Fading Multiple Access Relay Channels: Achievable Rates and Opportunistic Scheduling
• On the capacity of MIMO relay channels
• On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel
• On the Capacity of the Half-Duplex Diamond Channel Under Fixed Scheduling
• The Diversity-Multiplexing Tradeoff of the MIMO Half-Duplex Relay Channel
• On the Gaussian Half-Duplex Relay Channel

Cited in

(3)

• Performance of multiuser mixed RF/FSO relay networks with generalized order user scheduling and outdated channel information
• DMT of Parallel-Path and Layered Networks Under the Half-Duplex Constraint
• Optimal Spectrum Leasing and Resource Sharing in Two-Way Relay Networks

This page was built for publication: On Capacity and Optimal Scheduling for the Half-Duplex Multiple-Relay Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989771)