Related papers: Percolation for D2D Networks on Street Systems
Given two independent Poisson point processes $\Phi^{(1)},\Phi^{(2)}$ in $R^d$, the continuum AB percolation model is the graph with points of $\Phi^{(1)}$ as vertices and with edges between any pair of points for which the intersection of…
This paper investigates the performance of millimeter wave (mmWave) communications in clustered device-to-device (D2D) networks. The locations of D2D transceivers are modeled as a Poisson Cluster Process (PCP). In each cluster, devices are…
We analyze an idealized model for the transmission or flow of particles, or discrete packets of information, in a weight bearing branching hierarchical 2-D networks, and its variants. The capacities add hierarchically down the clusters.…
This paper addresses two fundamental and interrelated issues in device-to-device (D2D) enhanced cellular networks. The first issue is how D2D users should access spectrum, and we consider two choices: overlay (orthogonal spectrum between…
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…
Most networks of interest do not live in isolation. Instead they form components of larger systems in which multiple networks with distinct topologies coexist and where elements distributed amongst different networks may interact directly.…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
A device-to-device (D2D) wireless network is considered, where user devices also have the ability to cache content. In such networks, users are mobile and communication links can be spontaneously activated and dropped depending on the…
Over the past decade, many works on the modeling of wireless networks using stochastic geometry have been proposed. Results about probability of coverage, throughput or mean interference, have been provided for a wide variety of networks…
In this report, we consider how to dynamically select transmission bands and multi-hop routes for device-to-device (D2D) communications in co-existence with a cellular network overlay. Firstly, we consider different wireless routing…
We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…
Recently increasing attention has been addressed to the fluctuations observed in percolation defined in single and multiplex networks. These fluctuations are extremely important to characterize the robustness of real finite networks but…
Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often…
In the presented article, statistical properties regarding the topology and standard percolation on relative neighborhood graphs (RNGs) for planar sets of points, considering the Euclidean metric, are put under scrutiny. RNGs belong to the…
We introduce a general framework for the modeling and analysis of vehicular networks by defining street systems as random 1D subsets of $\mathbb{R}^{2}$. The street system, in turn, specifies the random intensity measure of a Cox process of…
Tremendous growing demand for high data rate services such as video, gaming and social networking in wireless cellular systems, attracted researchers' attention to focus on developing proximity services. In this regard, device-to-device…
Percolation on two-dimensional small-world networks has been proposed as a model for the spread of plant diseases. In this paper we give an analytic solution of this model using a combination of generating function methods and high-order…
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…
We investigate the behavior of extended urban traffic networks within the framework of percolation theory by using real and synthetic traffic data. Our main focus shifts from the statistical properties of the cluster size distribution…
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…