The asymptotic secrecy rate of decentralized wireless networks
Hourieh Ghorbani, Soroush Akhlaghi, Sayed Ali Khodam Hoseini · 2017
This paper studies the achievable secrecy rate of a decentralized wireless network consisting of N communication links exchanging information over a shared channel. It is assumed that there are M eavesdroppers attempting to listen to the transmitted information. In this regard, an on-off strategy is proposed to maximize the achievable secrecy rate of such network. Accordingly, it is shown that for large values of N, when the number of eavesdroppers (M) is less than N/(log n)2, the achievable sum secrecy-rate scales as log 2N/M−2log log N+ON(log(N).log log(N))/(log N)2.