This paper starts by assuming a 1-2-1 network, the abstracted noiseless model of mmWave networks that was shown to closely approximate the Gaussian capacity in , and studies secure communication. First, the secure capacity is derived for 1-2-1 networks where a source is connected to a destination through a network of unit capacity links. Then, lower and upper bounds on the secure capacity are derived for the case when source and destination have more than one beam, which allow them to transmit and receive in multiple directions at a time. Finally, secure capacity results are presented for diamond 1-2-1 networks when edges have different capacities.
|Original language||English (US)|
|Title of host publication||2018 IEEE International Symposium on Information Theory, ISIT 2018|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||5|
|State||Published - Aug 15 2018|
|Event||2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States|
Duration: Jun 17 2018 → Jun 22 2018
|Name||IEEE International Symposium on Information Theory - Proceedings|
|Other||2018 IEEE International Symposium on Information Theory, ISIT 2018|
|Period||6/17/18 → 6/22/18|
Bibliographical noteFunding Information:
The work of Y. H. Ezzeldin, G. K. Agarwal and C. Fragouli was supported in part by NSF under Awards 1514531, 1314937 and 1740047.
The work of Y. H. Ezzeldin, G. K. Agarwal and C. Fragouli was supported in part by NSF under Awards 1514531, 1314937 and 1740047
© 2018 IEEE.