arXiv 1007.40022010-07-22cs.ITcs.NImath.IT

Continuum Percolation in the Intrinsically Secure Communications Graph

Pedro C. Pinto, Moe Z. Win

备注：: Accepted in the IEEE International Symposium on Information Theory and its Applications (ISITA'10), Taichung, Taiwan, Oct. 2010
DOI：: 10.1109/ISITA.2010.5649155

英文摘要：

The intrinsically secure communications graph (iS-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence of eavesdroppers. It is based on principles of information-theoretic security, widely accepted as the strictest notion of security. In this paper, we are interested in characterizing the global properties of the iS-graph in terms of percolation on the infinite plane. We prove the existence of a phase transition in the Poisson iS-graph, whereby an unbounded component of securely connected nodes suddenly arises as we increase the density of legitimate nodes. Our work shows that long-range communication in a wireless network is still possible when a secrecy constraint is present.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Percolation and Connectivity in the Intrinsically Secure Communications Graph

The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely established over a large-scale network, by exploiting the physical properties of the wireless medium. This paper aims to characterize the global properties of the iS-graph in terms of: (i) percolation on the infinite plane, and (ii) full connectivity on a finite region. First, for the Poisson iS-graph defined on the infinite plane, the existence of a phase t…

2010-08-24cs.ITcs.NImath.IT

Super Critical and Sub Critical Regimes of Percolation with Secure Communication

Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and lower bounds on the minimum density of the legitimate nodes (as a function of the density of the eavesdropper nodes) required for non-zero probability of having an unbounded cluster are derived. The lower bound is universal in nature, i.e. the constant does not depend on the density of the eavesdropper nodes.

2011-04-06cs.ITmath.IT

Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph

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 $\bbR ^2$ of intensities $λ$ and $λ_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, …

2013-08-14cs.ITmath.ITmath.PR

Percolation in the Secrecy Graph

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 …

2012-08-13cs.ITmath.ITmath.PR

Wireless Secrecy in Large-Scale Networks

The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely established over a large-scale network, by exploiting the physical properties of the wireless medium. This paper provides an overview of the main properties of this new class of random graphs. We first analyze the local properties of the iS-graph, namely the degree distributions and their dependence on fading, target secrecy rate, and eavesdropper collusion.…

2011-02-17cs.ITcs.NImath.IT

Safeguarding the IoT from Malware Epidemics: A Percolation Theory Approach

The upcoming Internet of things (IoT) is foreseen to encompass massive numbers of connected devices, smart objects, and cyber-physical systems. Due to the large-scale and massive deployment of devices, it is deemed infeasible to safeguard 100% of the devices with state-of-the-art security countermeasures. Hence, large-scale IoT has inevitable loopholes for network intrusion and malware infiltration. Even worse, exploiting the high density of devices and direct wireless connectivity, malware infection can stealthily propagate through susceptible (i.e., unsecured) devices and form an epidemic ou…

2020-10-24cs.CRcs.ITmath.IT

更多相关论文收起更多论文

Techniques for Enhanced Physical-Layer Security

Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channels to strengthen the security of communications systems. Within this paradigm, we explore strategies to improve secure connectivity in a wireless network. We first consider the intrinsically secure communications graph (iS-graph), a convenient representation of the links that can be established with information-theoretic security on a large-scale network. We then propose and characterize two techniques--sectorized tra…

2010-08-22cs.ITcs.NImath.IT

The Secrecy Graph and Some of its Properties

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…

2008-04-14cs.DMcs.ITmath.IT

Secure Communication in Dynamic Wireless Ad hoc Networks

We consider a wireless ad hoc network in the presence of eavesdroppers (EDs), where the nodes are distributed according to independent Poisson point processes (PPPs). The legitimate nodes follow the half-duplex mode of operation employing the slotted ALOHA protocol for transmission. For such a network, a novel communication scheme that induces a time-varying secure connectivity graph (SCG) is proposed, and the connectivity behavior of this induced SCG is studied. In particular, for a legitimate node in the network, we analyze (i) the average number of incoming edges and the average number of o…

2019-05-06cs.ITmath.IT

Secure Communication in Stochastic Wireless Networks

Information-theoretic security -- widely accepted as the strictest notion of security -- relies on channel coding techniques that exploit the inherent randomness of the propagation channels to significantly strengthen the security of digital communications systems. Motivated by recent developments in the field, this paper aims at a characterization of the fundamental secrecy limits of wireless networks. Based on a general model in which legitimate nodes and potential eavesdroppers are randomly scattered in space, the intrinsically secure communications graph (iS-graph) is defined from the poin…

2010-01-21cs.CRcs.ITmath.IT

Physical Layer Key Generation for Secure Power Line Communications

Leakage of information in power line communication networks is a threat to privacy and security both in smart grids and in-home applications. A way to enhance security is to encode the transmitted information with a secret key. Relying on the channel properties, it is possible to generate a common key at the two communication ends without transmitting it through the broadcast channel. Since the key is generated locally, it is intrinsically secure from a possible eavesdropper. Most of the existing physical layer key generation techniques have been developed for symmetric channels. However, the …

2018-09-25cs.CRcs.ITmath.IT

Network Topology Modulation for Energy and Data Transmission in Internet of Magneto-Inductive Things

Internet-of-things (IoT) architectures connecting a massive number of heterogeneous devices need energy efficient, low hardware complexity, low cost, simple and secure mechanisms to realize communication among devices. One of the emerging schemes is to realize simultaneous wireless information and power transfer (SWIPT) in an energy harvesting network. Radio frequency (RF) solutions require special hardware and modulation methods for RF to direct current (DC) conversion and optimized operation to achieve SWIPT which are currently in an immature phase. On the other hand, magneto-inductive (MI) …

2017-01-26cs.ITmath.IT

面向下一代物联网的图神经网络：最新进展与开放挑战

Graph Neural Networks for Next-Generation-IoT: Recent Advances and Open Challenges

本综述全面探讨了图神经网络（GNNs）赋能下一代物联网（NG-IoT）系统的方法，通过将其建模为动态约束图并整合分布式框架，克服了传统优化局限，提升了网络效率、可扩展性与安全性。

2025-09-17cs.ITmath.IT