Distance Distributions in Regular Polygons

Abstract

This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular $\el$-sided polygon. Using this result, we obtain the closed-form probability density function (PDF) of the Euclidean distance between any arbitrary reference point and its $n$-th neighbour node, when $N$ nodes are uniformly and independently distributed inside a regular $\ell$-sided polygon. First, we exploit the rotational symmetry of the regular polygons and quantify the effect of polygon sides and vertices on the distance distributions. Then we propose an algorithm to determine the distance distributions given any arbitrary location of the reference point inside the polygon. For the special case when the arbitrary reference point is located at the center of the polygon, our framework reproduces the existing result in the literature.

13 pages, 5 figures

References in corpus (1)

• The Outage Probability of a Finite Ad Hoc Network in Nakagami Fading

Cited by in corpus (7)

• Downlink Coverage and Rate Analysis of Low Earth Orbit Satellite Constellations Using Stochastic Geometry
• Outage Probability in Arbitrarily-Shaped Finite Wireless Networks
• Performance Analysis of Arbitrarily-Shaped Underlay Cognitive Networks: Effects of Secondary User Activity Protocols
• Analyzing the Impact of Access Point Density on the Performance of Finite-Area Networks
• Large-Scale Fading Behavior for a Cellular Network with Uniform Spatial Distribution
• On the $k$ Nearest-Neighbor Path Distance from the Typical Intersection in the Manhattan Poisson Line Cox Process
• On the Terminal Location Uncertainty in Elliptical Footprints: Application in Air-to-Ground Links