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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
