On secrecy capacity scaling in wireless networks

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

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

21 Scopus citations

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
Event2010 Information Theory and Applications Workshop, ITA 2010 - San Diego, CA, United States
Duration: Jan 31 2010Feb 5 2010

Publication series

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

Other

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

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'On secrecy capacity scaling in wireless networks'. Together they form a unique fingerprint.

Cite this