Related papers: Percolation in the Secrecy Graph
Suppose each site independently and randomly chooses some sites around it, and it is weakly (strongly) connected with them (if there choose each other). What is the probability that the weak (strong) connected cluster is infinite? We…
In Part I of this paper, we presented a mathematical model for communication subject to both network interference and noise, where the interferers are scattered according to a spatial Poisson process, and are operating asynchronously in a…
In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless…
In this paper, an extended large wireless network under the secrecy constraint is considered. In contrast to works which use idealized assumptions, a more realistic network situation with unknown eavesdroppers locations is investigated: the…
Nodes are randomly distributed within an annulus (and then a shell) to form a point pattern of communication terminals which are linked stochastically according to the Rayleigh fading of radio-frequency data signals. We then present…
The ability to control a complex network towards a desired behavior relies on our understanding of the complex nature of these social and technological networks. The existence of numerous control schemes in a network promotes us to wonder:…
Percolation is a concept widely used in many fields of research and refers to the propagation of substances through porous media (e.g., coffee filtering), or the behaviour of complex networks (e.g., spreading of diseases). Percolation…
Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations.…
In many systems consisting of interacting subsystems, the complex interactions between elements can be represented using multilayer networks. However percolation, key to understanding connectivity and robustness, is not trivially…
An important class of real-world networks have directed edges, and in addition, some rank ordering on the nodes, for instance the "popularity" of users in online social networks. Yet, nearly all research related to explosive percolation has…
Two-hop security communication with an eavesdropper in wireless environment is a hot research direction. The basic idea is that the destination, simultaneously with the source, sends a jamming signal to interfere the eavesdropper near to or…
We develop a general theory for percolation in directed random networks with arbitrary two point correlations and bidirectional edges, that is, edges pointing in both directions simultaneously. These two ingredients alter the previously…
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.…
This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node…
Explosive percolation in a network is a phase transition where a large portion of nodes becomes connected with an addition of a small number of edges. Although extensively studied in random network models and reconstructed real 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…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…
We consider the problem of cross-layer resource allocation in time-varying cellular wireless networks, and incorporate information theoretic secrecy as a Quality of Service constraint. Specifically, each node in the network injects two…
Bootstrap percolation is an often used model to study the spread of diseases, rumors, and information on sparse random graphs. The percolation process demonstrates a critical value such that the graph is either almost completely affected or…