On secrecy capacity scaling in wireless networks

Onur Ozan Koyluoglu, Can Emre Koksal, Hesham El Gamal

Research output: Contribution to journalArticle

133 Citations (Scopus)

Abstract

This paper studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities λ and λ e , respectively. It is shown that, as long as λ eλ=o\ left(logn) -2}right) , almost all of the nodes achieve a perfectly secure rate of Ω(1radic;n}) for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multihop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Second, an ergodic fading model with n source-destination pairs and n e eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy precoding, each user is shown to achieve a constant positive secret rate for sufficiently large n. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized.

Original languageEnglish (US)
Article number6142080
Pages (from-to)3000-3015
Number of pages16
JournalIEEE Transactions on Information Theory
Volume58
Issue number5
DOIs
StatePublished - May 2012
Externally publishedYes

Fingerprint

secrecy
scaling
Wireless networks
Throughput
interference
performance

Keywords

  • Capacity scaling
  • information theoretic security
  • network information theory
  • secure throughput
  • wireless networks

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

On secrecy capacity scaling in wireless networks. / Koyluoglu, Onur Ozan; Koksal, Can Emre; Gamal, Hesham El.

In: IEEE Transactions on Information Theory, Vol. 58, No. 5, 6142080, 05.2012, p. 3000-3015.

Research output: Contribution to journalArticle

Koyluoglu, Onur Ozan ; Koksal, Can Emre ; Gamal, Hesham El. / On secrecy capacity scaling in wireless networks. In: IEEE Transactions on Information Theory. 2012 ; Vol. 58, No. 5. pp. 3000-3015.
@article{6e305a11f7a344579df177e4cac5cd57,
title = "On secrecy capacity scaling in wireless networks",
abstract = "This paper studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities λ and λ e , respectively. It is shown that, as long as λ eλ=o\ left(logn) -2}right) , almost all of the nodes achieve a perfectly secure rate of Ω(1radic;n}) for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multihop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Second, an ergodic fading model with n source-destination pairs and n e eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy precoding, each user is shown to achieve a constant positive secret rate for sufficiently large n. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized.",
keywords = "Capacity scaling, information theoretic security, network information theory, secure throughput, wireless networks",
author = "Koyluoglu, {Onur Ozan} and Koksal, {Can Emre} and Gamal, {Hesham El}",
year = "2012",
month = "5",
doi = "10.1109/TIT.2012.2184692",
language = "English (US)",
volume = "58",
pages = "3000--3015",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - On secrecy capacity scaling in wireless networks

AU - Koyluoglu, Onur Ozan

AU - Koksal, Can Emre

AU - Gamal, Hesham El

PY - 2012/5

Y1 - 2012/5

N2 - This paper studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities λ and λ e , respectively. It is shown that, as long as λ eλ=o\ left(logn) -2}right) , almost all of the nodes achieve a perfectly secure rate of Ω(1radic;n}) for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multihop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Second, an ergodic fading model with n source-destination pairs and n e eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy precoding, each user is shown to achieve a constant positive secret rate for sufficiently large n. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized.

AB - This paper studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes with intensities λ and λ e , respectively. It is shown that, as long as λ eλ=o\ left(logn) -2}right) , almost all of the nodes achieve a perfectly secure rate of Ω(1radic;n}) for the extended and dense network models. Therefore, under these assumptions, securing the network does not entail a loss in the per-node throughput. The achievability argument is based on a novel multihop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Second, an ergodic fading model with n source-destination pairs and n e eavesdroppers is considered. Employing the ergodic interference alignment scheme with an appropriate secrecy precoding, each user is shown to achieve a constant positive secret rate for sufficiently large n. Remarkably, the scheme does not require eavesdropper CSI (only the statistical knowledge is assumed) and the secure throughput per node increases as we add more legitimate users to the network in this setting. Finally, the effect of eavesdropper collusion on the performance of the proposed schemes is characterized.

KW - Capacity scaling

KW - information theoretic security

KW - network information theory

KW - secure throughput

KW - wireless networks

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

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

U2 - 10.1109/TIT.2012.2184692

DO - 10.1109/TIT.2012.2184692

M3 - Article

AN - SCOPUS:84860255627

VL - 58

SP - 3000

EP - 3015

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

M1 - 6142080

ER -