Distance Distributions in Regular Polygons
Authors:
- Zubair KhalidZKZubair Khalid
- Salman DurraniSDSalman Durrani
Preprint
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.
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- The Outage Probability of a Finite Ad Hoc Network in Nakagami FadingIEEE Transactions on Communications, 2012
- Distance distributions in random networksAd Hoc Networks, 2012
- Towards a Better Understanding of Large-Scale Network ModelsIEEE/ACM Transactions on Networking, 2011
- Probability distribution of distance between pairs of nearest stations in wireless networkElectronics Letters, 2010
- Distance Distributions in Finite Uniformly Random Networks: Theory and ApplicationsIEEE Transactions on Vehicular Technology, 2009
- On the Geometrical Characteristic of Wireless Ad-Hoc Networks and its Application in Network Performance AnalysisIEEE Transactions on Wireless Communications, 2007
- On Distances in Uniformly Random NetworksIEEE Transactions on Information Theory, 2005