Percolation for D2D networks on street systems
Authors
- Cali, Elie
- En-Najjari, Taoufik
- Gafur, Nila Novita
- Hirsch, Christian
- Jahnel, Benedikt
ORCID: 0000-0002-4212-0065 - Patterson, Robert I. A.
ORCID: 0000-0002-3583-2857
2010 Mathematics Subject Classification
- 60F10 60K35
Keywords
- Percolation, Cox processes, critical values, street systems, Voronoi tessellations, Delaunay tessellations
DOI
Abstract
We study fundamental characteristics for the connectivity of multi-hop D2D networks. Devices are randomly distributed on street systems and are able to communicate with each other whenever their separation is smaller than some connectivity threshold. We model the street systems as Poisson-Voronoi or Poisson-Delaunay tessellations with varying street lengths. We interpret the existence of adequate D2D connectivity as percolation of the underlying random graph. We derive and compare approximations for the critical device-intensity for percolation, the percolation probability and the graph distance. Our results show that for urban areas, the Poisson Boolean Model gives a very good approximation, while for rural areas, the percolation probability stays far from 1 even far above the percolation threshold.
Appeared in
- 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), IEEE Xplore digital library, 2018, pp. 1--6, DOI 10.23919/WIOPT.2018.8362866 .
Download Documents