The Throughput Cost of Information-Theoretic Security in Decentralized Wireless Networks
This paper studies the throughput of large-scale decentralized wireless networks with information theoretic security constraints. In particular, the authors are interested in the question of how much throughput needs to be sacrificed for achieving a certain level of security. They consider random networks where the legitimate nodes and the eavesdroppers are distributed according to independent two-dimensional Poisson point processes. The transmission capacity framework is used to characterize the area spectral efficiency of secure transmissions with constraints on both the Quality of Service (QoS) and the level of security. This framework illustrates the dependence of the network throughput on key system parameters, such as the densities of legitimate nodes and eavesdroppers, as well as the QoS and security constraints.