Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Finite-SNR Regime Analysis of The Gaussian Wiretap Multiple-Access Channel
KTH, School of Electrical Engineering (EES), Communication Networks.
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-3267-5374
2015 (English)In: 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, 2015, 307-314 p., 7447020Conference paper, Published paper (Refereed)
Abstract [en]

In this work, we consider a K-user Gaussian wiretap multiple-access channel (GW-MAC) in which each transmitter has an independent confidential message for the receiver. There is also an external eavesdropper who intercepts the communications. The goal is to transmit the messages reliably while keeping them confidential from the eavesdropper. To accomplish this goal, two different approaches have been proposed in prior works, namely, i.i.d. Gaussian random coding and real alignment. However, the former approach fails at moderate and high SNR regimes as its achievable result does not grow with SNR. On the other hand, while the latter approach gives a promising result at the infinite SNR regime, its extension to the finite-SNR regime is a challenging task. To fill the gap between the performance of the existing approaches, in this work, we establish a new scheme in which, at the receiver's side, it utilizes an extension of the compute-and-forward decoding strategy and at the transmitters' side it exploits lattice alignment, cooperative jamming, and i.i.d. random codes. For the proposed scheme, we derive a new achievable bound on sum secure rate which scales with log(SNR) and hence it outperforms the i.i.d. Gaussian codes in moderate and high SNR regimes. We evaluate the performance of our scheme, both theoretically and numerically. Furthermore, we show that our sum secure rate achieves the optimal sum secure degrees of freedom in the infinite-SNR regime.

Place, publisher, year, edition, pages
2015. 307-314 p., 7447020
Keyword [en]
Codes (symbols), Communication channels (information theory), Degrees of freedom (mechanics), Gaussian distribution, Transmitters, Compute and forwards, Confidential message, Cooperative jamming, Decoding strategy, Gaussian codes, Multiple access channels, Random coding, Regime analysis
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-172852DOI: 10.1109/ALLERTON.2015.7447020ISI: 000381622900042Scopus ID: 2-s2.0-84969792682OAI: oai:DiVA.org:kth-172852DiVA: diva2:850195
Conference
53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015; Allerton House, UIUCMonticello; United States; 29 September 2015 through 2 October 2015
Note

QC 20161005

Available from: 2015-09-01 Created: 2015-09-01 Last updated: 2016-10-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Salimi, SomayehPapadimitratos, Panos
By organisation
Communication Networks
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf