pith. sign in

arxiv: 1410.4896 · v1 · pith:Z3ADFQT3new · submitted 2014-10-18 · 💻 cs.IT · math.IT

Delay Optimal Secrecy in Two-Relay Network

classification 💻 cs.IT math.IT
keywords delayfeedbackoptimalchannelsrelaysourcestateschannel
0
0 comments X
read the original abstract

We consider a two-relay network in which a source aims to communicate a confidential message to a destination while keeping the message secret from the relay nodes. In the first hop, the channels from the source to the relays are assumed to be block-fading and the channel states change arbitrarily -possibly non-stationary and non-ergodic- across blocks. When the relay feedback on the states of the source-to-relay channels is available on the source with no delay, we provide an encoding strategy to achieve the optimal delay. We next consider the case in which there is one-block delayed relay feedback on the states of the source-to-relay channels. We show that for a set of channel state sequences, the optimal delay with one-block delayed feedback differs from the optimal delay with no-delayed feedback at most one block.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.