Percolation on the information theoretic secure SINR graph: Upper and lower bounds
Percolation on the information theoretic secure SINR graph: Upper and lower bounds
复制标题
DOI：
10.1109/wiopt.2014.6850356
复制
发表时间：
2014-05
期刊：
影响因子：
--
通讯作者：
R. Vaze;Srikanth K. Iyer
中科院分区：
文献类型：
--
作者：
R. Vaze;Srikanth K. Iyer
在一个信息理论安全图中，合法节点和窃听节点都服从泊松点过程分布。为了允许多个合法节点并发传输，引入了一个信干噪比安全图，并研究了它的渗流（具有无界连通分量）性质.研究表明，对于固定的窃听节点密度，当合法节点密度足够大（但有限），且合法节点的干扰抑制参数足够小时，逾渗现象发生。相反，得到一个具体的界限，表明如果合法的节点密度低于一个固定的阈值，那么渗透的概率为零。
Connectivity in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. To allow concurrent transmissions from multiple legitimate nodes, a signal-to-interference plus noise ratio secure graph is introduced, and its percolation (having an unbounded connected component) properties are studied. It is shown that for a fixed eavesdropper node density, percolation happens for large enough (but finite) legitimate node density and small enough interference suppression parameter of the legitimate nodes. Conversely, a concrete bound is obtained that shows that if the legitimate node density is below a fixed threshold, then the probability of percolation is zero.