Percolation on the information-theoretically secure signal to interference ratio graph

MaRDI QIDQ5176509zbMATH OpenFDO

Authors Rahul Vaze, Srikanth K. Iyer

Publication date 26 February 2015

Full work available at URL https://arxiv.org/abs/1308.3155, https://projecteuclid.org/euclid.jap/1421763317

zbMATH Keywords

percolationsignal-to-noise ratiothreshold graphwireless communication

Mathematics Subject Classification ID

Trees (05C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Communication theory (94A05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Cryptography (94A60) Applications of graph theory to circuits and networks (94C15)

Abstract: We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes (PPPs) in $$ of intensities $lambda$ and $lambd{a}_E$ respectively. A directed edge from one legitimate node $A$ to another legitimate node $B$ exists provided the strength of the {it signal} transmitted from node $A$ that is received at node $B$ is higher than that received at any eavesdropper node. The strength of the received signal at a node from a legitimate node depends not only on the distance between these nodes, but also on the location of the other legitimate nodes and an interference suppression parameter $gamma$. The graph is said to percolate when there exists an infinite connected component. We show that for any finite intensity $lambd{a}_E$ of eavesdropper nodes, there exists a critical intensity $lambd{a}_c<infty$ such that for all $lambda>lambd{a}_c$ the graph percolates for sufficiently small values of the interference parameter. Furthermore, for the sub-critical regime, we show that there exists a $lambd{a}_0$ such that for all $lambda<lambd{a}_{0}leqlambd{a}_c$ a suitable graph defined over eavesdropper node connections percolates that precludes percolation in the graphs formed by the legitimate nodes.

Recommendations

• Percolation in the secrecy graph
• Percolation in the signal to interference ratio graph
• SINR percolation for Cox point processes with random powers
• Signal to interference ratio percolation for Cox point processes
• Secrecy coverage

Cites work

• Continuum Percolation
• Percolation
• Percolation and Connectivity in the Intrinsically Secure Communications Graph
• Percolation in the secrecy graph
• Percolation in the signal to interference ratio graph
• Random Geometric Graphs
• The capacity of wireless networks
• The Wire-Tap Channel

Cited in

(6)

• \textit{D\_PSNI}: delimited persistent stochastic non-interference
• Percolation in the secrecy graph
• Secrecy coverage
• Percolation in the signal to interference ratio graph
• SINR percolation for Cox point processes with random powers
• Signal to interference ratio percolation for Cox point processes

This page was built for publication: Percolation on the information-theoretically secure signal to interference ratio graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176509)