TY - GEN
T1 - The Gaussian multiple access wire-tap channel
T2 - 2007 Information Theory and Applications Workshop, ITA
AU - Tekin, Ender
AU - Yener, Aylin
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy measures, termed individual and collective, to reflect the confidence in the system for this multi-access environment. We determine achievable rates such that secrecy to some predetermined degree can be maintained, using Gaussian codebooks. We also find outer bounds for the case when the eavesdropper receives a degraded version of the intended receiver's signal. In the degraded case, Gaussian codewords are shown to achieve the sum capacity for collective constraints. In addition, a TDMA scheme is shown to also achieve sum capacity for both sets of constraints. Numerical results showing the new rate region are presented and compared with the capacity region of the Gaussian Multiple-Access Channel (GMAC) with no secrecy constraints. We then find the secrecy sum-rate maximizing power allocations for the transmitters, and show that a cooperative jamming scheme can be used to increase achievable rates in this scenario.
AB - We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy measures, termed individual and collective, to reflect the confidence in the system for this multi-access environment. We determine achievable rates such that secrecy to some predetermined degree can be maintained, using Gaussian codebooks. We also find outer bounds for the case when the eavesdropper receives a degraded version of the intended receiver's signal. In the degraded case, Gaussian codewords are shown to achieve the sum capacity for collective constraints. In addition, a TDMA scheme is shown to also achieve sum capacity for both sets of constraints. Numerical results showing the new rate region are presented and compared with the capacity region of the Gaussian Multiple-Access Channel (GMAC) with no secrecy constraints. We then find the secrecy sum-rate maximizing power allocations for the transmitters, and show that a cooperative jamming scheme can be used to increase achievable rates in this scenario.
UR - http://www.scopus.com/inward/record.url?scp=48049102969&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=48049102969&partnerID=8YFLogxK
U2 - 10.1109/ITA.2007.4357611
DO - 10.1109/ITA.2007.4357611
M3 - Conference contribution
AN - SCOPUS:48049102969
SN - 9780615153148
T3 - 2007 Information Theory and Applications Workshop, Conference Proceedings, ITA
SP - 404
EP - 413
BT - 2007 Information Theory and Applications Workshop, Conference Proceedings, ITA
Y2 - 29 January 2007 through 2 February 2007
ER -