Document Type
Article
Publication Date
9-2013
Keywords
Secrecy graph
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.
Publication Title
Discrete Applied Mathematics
Volume
161
Issue
13-14
First Page
2120
Last Page
2132
DOI
http://dx.doi.org/10.1016/j.dam.2013.03.022
Recommended Citation
Sarkar, Amites and Haenggi, Martin, "Percolation in the Secrecy Graph" (2013). Mathematics Faculty Publications. 87.
https://cedar.wwu.edu/math_facpubs/87
Subjects - Topical (LCSH)
Percolation (Statistical physics); Branching processes; Wireless sensor networks--Security measures; Security systems--Mathematical models
Genre/Form
articles
Type
Text
Rights
Copying of this document in whole or in part is allowable only for scholarly purposes. It is understood, however, that any copying or publication of this document for commercial purposes, or for financial gain, shall not be allowed without the author’s written permission.
Language
English
Format
application/pdf
Comments
This is the authors' version of the article. The publisher version is available here: http://www.sciencedirect.com/science/article/pii/S0166218X13001698