The Secrecy Graph and Some of its Properties

Abstract

A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The underlying point process models considered are lattices and Poisson point processes. In the lattice case, analogies to standard bond and site percolation can be exploited to determine percolation thresholds. In the Poisson case, the node degrees are determined and percolation is studied using analytical bounds and simulations. It turns out that a small density of eavesdroppers already has a drastic impact on the connectivity of the secrecy graph.

5 pages. Accepted at 2008 IEEE Symposium on Information Theory (ISIT'08)

References in corpus (1)

• Continuum percolation with steps in an annulus

Cited by in corpus (23)

• Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
• On the Throughput Cost of Physical Layer Security in Decentralized Wireless Networks
• Physical Layer Security in Downlink Multi-Antenna Cellular Networks
• Physical Layer Security in Cellular Networks: A Stochastic Geometry Approach
• When Does Relay Transmission Give a More Secure Connection in Wireless Ad Hoc Networks?
• Wireless Physical Layer Security with Imperfect Channel State Information: A Survey
• On Eavesdropper-Tolerance Capability of Two-Hop Wireless Networks
• Continuum Percolation in the Intrinsically Secure Communications Graph
• Distribution of Cell Area in Bounded Poisson Voronoi Tessellations with Application to Secure Local Connectivity
• Secure Communication in Stochastic Wireless Networks
• Wireless Secrecy in Large-Scale Networks
• Secrecy of Multi-Antenna Transmission with Full-Duplex User in the Presence of Randomly Located Eavesdroppers
• Techniques for Enhanced Physical-Layer Security
• On Secrecy Capacity Scaling in Wireless Networks
• Boundaries as an Enhancement Technique for Physical Layer Security
• On secure communication in sensor networks under q-composite key predistribution with unreliable links
• Percolation and Connectivity in the Intrinsically Secure Communications Graph
• Secrecy Rates in the Broadcast Channel with Confidential Messages and External Eavesdroppers
• Securing Visible Light Communication Systems by Beamforming in the Presence of Randomly Distributed Eavesdroppers
• Tradeoff between Delay and Physical Layer Security in Wireless Networks
• Efficient Wireless Security Through Jamming, Coding and Routing
• Secrecy Transmission Capacity in Noisy Wireless Ad Hoc Networks
• Secure Communication in Dynamic Wireless Ad hoc Networks