The Gaussian many-to-one interference channel with confidential messages

  • Authors:
  • Xiang He;Aylin Yener

  • Affiliations:
  • Wireless Communications and Networking Laboratory, Electrical Engineering Department, The Pennsylvania State University, University Park, PA;Wireless Communications and Networking Laboratory, Electrical Engineering Department, The Pennsylvania State University, University Park, PA

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate the K-user many-to-one interference channel with confidential messages in which the K th user experiences interference from all other K - 1 users, and is at the same time treated as an eavesdropper to all the messages of these users. We derive achievable rates and an upper bound on the sum rate for this channel and show that the gap between the achievable sum rate and its upper bound is log2(K - 1) bits per channel use under very strong interference, when the interfering users have equal power constraints and interfering link channel gains. The main contributions of this work are: (i) nested lattice codes are shown to provide secrecy when interference is present, (ii) a secrecy sum rate upper bound is found for strong interference regime and (iii) it is proved that under very strong interference and a symmetric setting, the gap between the achievable sum rate and the upper bound is constant with respect to transmission powers.