On secrecy capacity scaling in wireless networks

O. Ozan Koyluoglu, C. Emre Koksal, Hesham El Gamal
2010 2010 Information Theory and Applications Workshop (ITA)  
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
more » ... 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.
doi:10.1109/ita.2010.5454119 dblp:conf/ita/KoyluogluKG10 fatcat:ju7y2lxzw5fq5hjqqlxj2szbwq