On the parallel relay wire-tap network

Soheil Mohajer, Suhas N. Diggavi, H. Vincent Poor, Shlomo Shamai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

Information-theoretic secrecy is studied for a parallel relay (diamond) network, in which a transmitter wishes to communicate to a receiver through two relay nodes. While there is no direct link between the transmitter and receiver and all flow of information has to be transmitted through the relays, the message has to be kept secret from each of them. The exact secrecy capacity is characterized for the network under the linear deterministic model. The problem is then studied when each terminal is equipped with multiple antennas, and the channels are parallel Gaussian links. Lower and upper bounds for the secrecy capacity are derived, and the gap is bounded by a constant independent of the channel parameters and SNR. This results in an approximate characterization for the secrecy capacity of the parallel Gaussian diamond network.

Original languageEnglish (US)
Title of host publication2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Pages418-425
Number of pages8
DOIs
StatePublished - Dec 1 2011
Event2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 - Monticello, IL, United States
Duration: Sep 28 2011Sep 30 2011

Other

Other2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
CountryUnited States
CityMonticello, IL
Period9/28/119/30/11

Fingerprint Dive into the research topics of 'On the parallel relay wire-tap network'. Together they form a unique fingerprint.

Cite this