Please use this identifier to cite or link to this item:
Title: On capacity and optimal scheduling for the half-duplex multiple-relay channel
Authors: Ong, L.
Motani, M. 
Johnson, S.J.
Keywords: Decode-forward (DF)
half duplex
multiple-relay channel (MRC)
phase fading
Issue Date: 2012
Citation: Ong, L., Motani, M., Johnson, S.J. (2012). On capacity and optimal scheduling for the half-duplex multiple-relay channel. IEEE Transactions on Information Theory 58 (9) : 5770-5784. ScholarBank@NUS Repository.
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. © 1963-2012 IEEE.
Source Title: IEEE Transactions on Information Theory
ISSN: 00189448
DOI: 10.1109/TIT.2012.2204489
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Feb 20, 2019


checked on Feb 12, 2019

Page view(s)

checked on Oct 13, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.