Distance Distributions in Regular Polygons

This paper derives the exact cumulative density function (cdf) of the distance between a randomly located node and any arbitrary reference point inside a regular L-sided polygon. Using this result, we obtain the closed-form probability density function of the Euclidean distance between any arbitrary reference point and its nth neighbor node when N nodes are uniformly and independently distributed inside a regular L-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.

[1]  Martin Haenggi,et al.  Distance Distributions in Finite Uniformly Random Networks: Theory and Applications , 2008, IEEE Transactions on Vehicular Technology.

[2]  Brian D. O. Anderson,et al.  Towards a Better Understanding of Large-Scale Network Models , 2010, IEEE/ACM Transactions on Networking.

[3]  A. M. Mathai An Introduction to Geometrical Probability: Distributional Aspects with Applications , 1999 .

[4]  Christian Bettstetter,et al.  On the Connectivity of Ad Hoc Networks , 2004, Comput. J..

[5]  Khaled Ben Letaief,et al.  On the Geometrical Characteristic of Wireless Ad-Hoc Networks and its Application in Network Performance Analysis , 2007, IEEE Transactions on Wireless Communications.

[6]  Jianping Pan,et al.  Random Distances Associated With Equilateral Triangles , 2012, 1207.1511.

[7]  Martin Haenggi,et al.  On distances in uniformly random networks , 2005, IEEE Transactions on Information Theory.

[8]  Uwe Baesel Random chords and point distances in regular polygons , 2012 .

[9]  W. Marsden I and J , 2012 .

[10]  Flavio Fabbri,et al.  A statistical model for the connectivity of nodes in a multi-sink wireless sensor network over a bounded region , 2008, 2008 14th European Wireless Conference.

[11]  Jianping Pan,et al.  Random Distances Associated with Hexagons , 2011, ArXiv.

[12]  Uwe Basel Random chords and point distances in regular polygons , 2012 .

[13]  A. Kostin,et al.  Probability distribution of distance between pairs of nearest stations in wireless network , 2010 .

[14]  Matthew C. Valenti,et al.  The Outage Probability of a Finite Ad Hoc Network in Nakagami Fading , 2012, IEEE Transactions on Communications.

[15]  Dmitri Moltchanov,et al.  Distance distributions in random networks , 2012, Ad Hoc Networks.

[16]  Salman Durrani,et al.  A Tractable Framework for Exact Probability of Node Isolation in Finite Wireless Sensor Networks , 2012, ArXiv.

[17]  Jeffrey G. Andrews,et al.  Transmission Capacity of Wireless Networks , 2012, Found. Trends Netw..

[18]  Angel R. Martinez,et al.  Computational Statistics Handbook with MATLAB , 2001 .

[19]  M. Haenggi,et al.  Interference in Large Wireless Networks , 2009, Found. Trends Netw..