Skip to main content
Article
Percolation in the Secrecy Graph
Discrete Applied Mathematics
  • Amites Sarkar, Western Washington University
  • Martin Haenggi
Document Type
Article
Publication Date
9-1-2013
Disciplines
Abstract

The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the presence of eavesdroppers, which, in the model, is determined solely by the locations of the nodes and eavesdroppers. In the case of infinite networks, a critical parameter is the maximum density of eavesdroppers that can be accommodated while still guaranteeing an infinite component in the network, i.e., the percolation threshold. We focus on the case where the locations of the nodes and eavesdroppers are given by Poisson point processes, and present bounds for different types of percolation, including in-, out- and undirected percolation.

Required Publisher's Statement

This is the authors' version of the article. The publisher version is available here: http://www.sciencedirect.com/science/article/pii/S0166218X13001698

Comments

This is the authors' version of the article. The publisher version is available here: http://www.sciencedirect.com/science/article/pii/S0166218X13001698

Citation Information
Amites Sarkar and Martin Haenggi. "Percolation in the Secrecy Graph" Discrete Applied Mathematics Vol. 161 Iss. 13-14 (2013) p. 2120 - 2132
Available at: http://works.bepress.com/amites_sarkar/5/