Security-capacity trade-off in large wireless networks using keyless secrecy

Abstract

We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n randomly located nodes. We describe a construction in which nodes transmit artificial noise to suppress eavesdroppers whose locations are unknown and ensure secrecy of messages transported across the network. Under a model in which eavesdroppers operate independently and under appropriate conditions on the achievable per-node throughput Ψ(n), we show that the network can tolerate Ω " " 1 √ n Ψ(n) " 2c « eavesdroppers while ensuring that the aggregate rate at which eavesdroppers intercept packets goes to 0, where c is a constant such that 0 < c < 1. The result clearly establishes a trade-off between the achievable throughput and the allowable number of eavesdroppers. Under a collaborating eavesdropper model and a similar constraint on the eavesdropper throughput, we show that the network can tolerate a single eavesdropper with Ω " " ln " 1 √ n Ψ(n) "" 1−ǫ « antennas, ∀ǫ > 0. We also establish sufficient conditions on the number of eavesdroppers to achieve a non-zero throughput in our construction.

Secrecy capacity in large cooperative networks in presence of eavesdroppers with unknown locations

“…We start from the right side of the constraint (13) in the recent theorem and insert the value of a (k)…”

Secrecy Throughput in Inhomogeneous Wireless Networks with Nonuniform Traffic

“…As shown in Lemma 6 and according to (6), the secrecy rate ( ) which each square can obtain is as follows:…”

“…Consequently, it is urgent to reveal the effect of this technology on the network performance such as capacity and connectivity. In [6], Vasudevan et al investigated the trade-off between capacity and security in large-scale wireless networks. To 2 International Journal of Distributed Sensor Networks degrade the channel of eavesdropper, the authors used helper nodes around the transmitters to generate artificial noise.…”

On Secure Wireless Communications for Service Oriented Computing

“…For instance, the per-node secure throughput in large decentralized networks was explored in [17], [18], [28], the secrecy capacity maximization problem was investigated in [19]- [21] based on cooperative communication, how to design efficient jamming strategies in terms of power or position of jamming was analyzed in [22]- [24], the opportunistic selection and use of the relays to enhance the physical layer security was studied in [25]- [27]. However, to the best of our knowledge, relatively fewer works consider the performance limits of the eavesdropper-tolerance capability of a network.…”

“…For infinite network scenarios, the scaling law of eavesdropper-tolerance capability against the per-node throughput was studied in [28] by constructing a highway system. By cooperative jamming, Goeckel et al [31] considered one source-destination pair with opportunistic relaying scheme [32], where the best relay is selected among the available relays based on some policy in terms of their channels to the source and destination, and analyzed the asymptotic behavior of eavesdropper-tolerance capability as the number of relays goes to infinity.…”