On secrecy capacity scaling in wireless networks

Onur Ozan Koyluoglu, C. Emre Koksal, Hesham El Gamal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

We study a random extended network, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes in a square region of area n. It is shown that, when the legitimate nodes have unit intensity, λ = 1, and the eavesdroppers have an intensity of λe = O((log n)-2), almost all of the nodes achieve a perfectly secure rate of Ω(1/√n). The achievability argument is based on a novel multi-hop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Remarkable, under these assumptions, securing the transmissions of nodes does not entail a loss in the per-node throughput in terms of scaling.

Original languageEnglish (US)
Title of host publication2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings
Pages229-232
Number of pages4
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 Information Theory and Applications Workshop, ITA 2010 - San Diego, CA, United States
Duration: Jan 31 2010Feb 5 2010

Other

Other2010 Information Theory and Applications Workshop, ITA 2010
CountryUnited States
CitySan Diego, CA
Period1/31/102/5/10

Fingerprint

Wireless networks
Throughput

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Koyluoglu, O. O., Koksal, C. E., & El Gamal, H. (2010). On secrecy capacity scaling in wireless networks. In 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings (pp. 229-232). [5454119] https://doi.org/10.1109/ITA.2010.5454119

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

2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings. 2010. p. 229-232 5454119.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Koyluoglu, OO, Koksal, CE & El Gamal, H 2010, On secrecy capacity scaling in wireless networks. in 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings., 5454119, pp. 229-232, 2010 Information Theory and Applications Workshop, ITA 2010, San Diego, CA, United States, 1/31/10. https://doi.org/10.1109/ITA.2010.5454119
Koyluoglu OO, Koksal CE, El Gamal H. On secrecy capacity scaling in wireless networks. In 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings. 2010. p. 229-232. 5454119 https://doi.org/10.1109/ITA.2010.5454119
Koyluoglu, Onur Ozan ; Koksal, C. Emre ; El Gamal, Hesham. / On secrecy capacity scaling in wireless networks. 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings. 2010. pp. 229-232
@inproceedings{7ac5ad4b7615457e8970ef6e831faabf,
title = "On secrecy capacity scaling in wireless networks",
abstract = "We study a random extended network, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes in a square region of area n. It is shown that, when the legitimate nodes have unit intensity, λ = 1, and the eavesdroppers have an intensity of λe = O((log n)-2), almost all of the nodes achieve a perfectly secure rate of Ω(1/√n). The achievability argument is based on a novel multi-hop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Remarkable, under these assumptions, securing the transmissions of nodes does not entail a loss in the per-node throughput in terms of scaling.",
author = "Koyluoglu, {Onur Ozan} and Koksal, {C. Emre} and {El Gamal}, Hesham",
year = "2010",
doi = "10.1109/ITA.2010.5454119",
language = "English (US)",
isbn = "9781424470143",
pages = "229--232",
booktitle = "2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings",

}

TY - GEN

T1 - On secrecy capacity scaling in wireless networks

AU - Koyluoglu, Onur Ozan

AU - Koksal, C. Emre

AU - El Gamal, Hesham

PY - 2010

Y1 - 2010

N2 - We study a random extended network, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes in a square region of area n. It is shown that, when the legitimate nodes have unit intensity, λ = 1, and the eavesdroppers have an intensity of λe = O((log n)-2), almost all of the nodes achieve a perfectly secure rate of Ω(1/√n). The achievability argument is based on a novel multi-hop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Remarkable, under these assumptions, securing the transmissions of nodes does not entail a loss in the per-node throughput in terms of scaling.

AB - We study a random extended network, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes in a square region of area n. It is shown that, when the legitimate nodes have unit intensity, λ = 1, and the eavesdroppers have an intensity of λe = O((log n)-2), almost all of the nodes achieve a perfectly secure rate of Ω(1/√n). The achievability argument is based on a novel multi-hop forwarding scheme where randomization is added in every hop to ensure maximal ambiguity at the eavesdropper(s). Remarkable, under these assumptions, securing the transmissions of nodes does not entail a loss in the per-node throughput in terms of scaling.

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

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

U2 - 10.1109/ITA.2010.5454119

DO - 10.1109/ITA.2010.5454119

M3 - Conference contribution

SN - 9781424470143

SP - 229

EP - 232

BT - 2010 Information Theory and Applications Workshop, ITA 2010 - Conference Proceedings

ER -