On the parallel relay wire-tap network

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

doi:10.1109/Allerton.2011.6120197

On the parallel relay wire-tap network

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Pages	418-425
Number of pages	8
DOIs	https://doi.org/10.1109/Allerton.2011.6120197
State	Published - 2011
Event	2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 - Monticello, IL, United States Duration: Sep 28 2011 → Sep 30 2011

Publication series

Name	2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Other

Other	2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Country/Territory	United States
City	Monticello, IL
Period	9/28/11 → 9/30/11

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Control and Systems Engineering

Access to Document

10.1109/Allerton.2011.6120197

Cite this

Mohajer, S., Diggavi, S. N., Poor, H. V., & Shamai, S. (2011). On the parallel relay wire-tap network. In 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 (pp. 418-425). Article 6120197 (2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011). https://doi.org/10.1109/Allerton.2011.6120197

@inproceedings{18d3bac5122c49e2b72923c59916afdb,

title = "On the parallel relay wire-tap network",

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.",

author = "Soheil Mohajer and Diggavi, {Suhas N.} and Poor, {H. Vincent} and Shlomo Shamai",

year = "2011",

doi = "10.1109/Allerton.2011.6120197",

language = "English (US)",

isbn = "9781457718168",

series = "2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011",

pages = "418--425",

booktitle = "2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011",

note = "2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 ; Conference date: 28-09-2011 Through 30-09-2011",

}

Mohajer, S, Diggavi, SN, Poor, HV & Shamai, S 2011, On the parallel relay wire-tap network. in 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011., 6120197, 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, pp. 418-425, 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, Monticello, IL, United States, 9/28/11. https://doi.org/10.1109/Allerton.2011.6120197

On the parallel relay wire-tap network. / Mohajer, Soheil; Diggavi, Suhas N.; Poor, H. Vincent et al.
2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011. 2011. p. 418-425 6120197 (2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - On the parallel relay wire-tap network

AU - Mohajer, Soheil

AU - Diggavi, Suhas N.

AU - Poor, H. Vincent

AU - Shamai, Shlomo

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84856103788&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84856103788&partnerID=8YFLogxK

U2 - 10.1109/Allerton.2011.6120197

DO - 10.1109/Allerton.2011.6120197

M3 - Conference contribution

AN - SCOPUS:84856103788

SN - 9781457718168

T3 - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

SP - 418

EP - 425

BT - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

T2 - 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Y2 - 28 September 2011 through 30 September 2011

ER -

On the parallel relay wire-tap network

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this