相关论文: Percolation on the Signal to Interference Ratio Gr…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…
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…
Previous studies of connectivity in wireless networks have focused on undirected geometric graphs. More sophisticated models such as Signal-to-Interference-and-Noise-Ratio (SINR) model, however, usually leads to directed graphs. In this…
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…
Signal-to-interference plus noise ratio (SINR) percolation is an infinite-range dependent variant of continuum percolation modeling connections in a telecommunication network. Unlike in earlier works, in the present paper the transmitted…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We study the problem of wireless network resilience to node failures from a percolation-based perspective. In practical wireless networks, it is often the case that the failure probability of a node depends on its degree (number of…
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…
In a large-scale wireless ad hoc network in which all transmitters form a homogeneous of Poisson point process, the statistics of the signal-to-interference ratio (SIR) in prior work is only derived in closed-form for the case of Rayleigh…
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…
The analysis of signal-to-interference ratios (SIRs) in wireless networks is instrumental to derive important performance metrics, including reliability, throughput, and delay. While a host of results on SIR distributions are now available,…
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…
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 $\lambda$ and $\lambda_E$…
In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the locations of the transmitters is often modeled as a Poisson…
We study the SIR ("susceptible, infected, removed/recovered") model on directed graphs with heterogeneous transmission probabilities within the message-passing approximation. We characterize the percolation transition, predict cluster size…
The calculation of the SIR distribution at the typical receiver (or, equivalently, the success probability of transmissions over the typical link) in Poisson bipolar and cellular networks with Rayleigh fading is relatively straightforward,…
In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson clustered…
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…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
We present a mathematical model for communication subject to both network interference and noise. We introduce a framework where the interferers are scattered according to a spatial Poisson process, and are operating asynchronously in a…