On the Throughput Cost of Physical Layer Security in Decentralized Wireless Networks

This paper studies the throughput of large-scale decentralized wireless networks with physical layer security constraints. In particular, we are interested in the question of how much throughput needs to be sacrificed for achieving a certain level of security. We 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. One important finding is that the throughput cost of achieving a moderate level of security is quite low, while throughput must be significantly sacrificed to realize a highly secure network. We also study the use of a secrecy guard zone, which is shown to give a significant improvement on the throughput of networks with high security requirements.

[1]  Roy D. Yates,et al.  Secret Communication via Multi-antenna Transmission , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[2]  Martin Haenggi,et al.  On distances in uniformly random networks , 2005, IEEE Transactions on Information Theory.

[3]  Sennur Ulukus,et al.  Secrecy in Cooperative Relay Broadcast Channels , 2008, IEEE Transactions on Information Theory.

[4]  Jeffrey G. Andrews,et al.  Stochastic geometry and random graphs for the analysis and design of wireless networks , 2009, IEEE Journal on Selected Areas in Communications.

[5]  Martin Haenggi,et al.  Single-Hop Connectivity in Interference-Limited Hybrid Wireless Networks , 2007, 2007 IEEE International Symposium on Information Theory.

[6]  Donald F. Towsley,et al.  Security-capacity trade-off in large wireless networks using keyless secrecy , 2010, MobiHoc '10.

[7]  Moe Z. Win,et al.  Continuum percolation in the intrinsically secure communications graph , 2010, 2010 International Symposium On Information Theory & Its Applications.

[8]  Jeffrey G. Andrews,et al.  The Guard Zone in Wireless Ad hoc Networks , 2007, IEEE Transactions on Wireless Communications.

[9]  Ender Tekin,et al.  The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming , 2007, IEEE Transactions on Information Theory.

[10]  G. Wornell,et al.  Secure Transmission with Multiple Antennas: The MIMOME Channel , 2008 .

[11]  H. Vincent Poor,et al.  Multiple-Access Channels With Confidential Messages , 2008, IEEE Transactions on Information Theory.

[12]  Andrew Thangaraj,et al.  Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes , 2010, IEEE Transactions on Information Forensics and Security.

[13]  Gregory W. Wornell,et al.  Secure Transmission With Multiple Antennas—Part II: The MIMOME Wiretap Channel , 2007, IEEE Transactions on Information Theory.

[14]  A. Robert Calderbank,et al.  Modeling location uncertainty for eavesdroppers: A secrecy graph approach , 2010, 2010 IEEE International Symposium on Information Theory.

[15]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[16]  D. F. Hays,et al.  Table of Integrals, Series, and Products , 1966 .

[17]  François Baccelli,et al.  An Aloha protocol for multihop mobile wireless networks , 2006, IEEE Transactions on Information Theory.

[18]  Rohit Negi,et al.  Guaranteeing Secrecy using Artificial Noise , 2008, IEEE Transactions on Wireless Communications.

[19]  H. Vincent Poor,et al.  Interference Assisted Secret Communication , 2008, IEEE Transactions on Information Theory.

[20]  Moe Z. Win,et al.  Secure Communication in Stochastic Wireless Networks , 2010, ArXiv.

[21]  Hesham El Gamal,et al.  The Relay–Eavesdropper Channel: Cooperation for Secrecy , 2006, IEEE Transactions on Information Theory.

[22]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[23]  Martin Haenggi,et al.  Secrecy coverage , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.

[24]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[25]  Zhu Han,et al.  Secure wireless communications via cooperation , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[26]  Jeffrey G. Andrews,et al.  Transmission capacity of wireless ad hoc networks with outage constraints , 2005, IEEE Transactions on Information Theory.

[27]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[28]  Onur Ozan Koyluoglu,et al.  On Secrecy Capacity Scaling in Wireless Networks , 2012, IEEE Transactions on Information Theory.

[29]  Martin Haenggi The secrecy graph and some of its properties , 2008, 2008 IEEE International Symposium on Information Theory.

[30]  M. Haenggi,et al.  Shot Noise Models for Outage and Throughput Analyses in Wireless Ad Hoc Networks , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[31]  Jeffrey G. Andrews,et al.  Secure Wireless Network Connectivity with Multi-Antenna Transmission , 2011, IEEE Transactions on Wireless Communications.

[32]  H. Vincent Poor,et al.  On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels , 2007, IEEE Transactions on Information Theory.

[33]  H. Vincent Poor,et al.  Secrecy throughput of MANETs with malicious nodes , 2009, 2009 IEEE International Symposium on Information Theory.

[34]  T. Mattfeldt Stochastic Geometry and Its Applications , 1996 .

[35]  Sennur Ulukus,et al.  Achievable Rates in Gaussian MISO Channels with Secrecy Constraints , 2007, 2007 IEEE International Symposium on Information Theory.

[36]  A. Robert Calderbank,et al.  Applications of LDPC Codes to the Wiretap Channel , 2004, IEEE Transactions on Information Theory.