Abstract
In this paper, we focus on the link density in random geometric graphs (RGGs) with a distance-based connection function. After deriving the link density in D dimensions, we focus on the two-dimensional (2D) and three-dimensional (3D) space and show that the link density is accurately approximated by the Fréchet distribution, for any rectangular space. We derive expressions, in terms of the link density, for the minimum number of nodes needed in the 2D and 3D spaces to ensure network connectivity. These results provide first-order estimates for, e.g., a swarm of drones to provide coverage in a disaster or crowded area.
Original language | English |
---|---|
Article number | 024301 |
Pages (from-to) | 024301-1 - 024301-12 |
Number of pages | 12 |
Journal | Physical Review E |
Volume | 106 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2022 |
Bibliographical note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-careOtherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.