Dropped Edges and Faces' Size in Gabriel and Relative Neighborhood Graphs

We have developed a mathematical model for calculation of expected value of share of edges being dropped while constructing a Gabriel or a relative neighborhood graph starting from a random geometrical graph created by a homogeneous Poisson point process on a plane. The expressions for the expected values of number of faces and face size are derived as well. All expressions are given as functions of deployment configuration. The results are verified through detailed comparison with extensive simulation results. Since Gabriel and relative neighborhood graphs are used for various applications in ad hoc networking we believe that our model simplifies theoretical analysis of functionality and performance of such networks

[1]  Ivan Stojmenovic,et al.  Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks , 2005, Ad Hoc Networks.

[2]  Massimo Franceschetti,et al.  Ad hoc wireless networks with noisy links , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[3]  Jehoshua Bruck,et al.  Continuum Percolation with Unreliable and Spread-Out Connections , 2005 .

[4]  Ivan Stojmenovic,et al.  Bluetooth scatternet formation for single-hop ad hoc networks based on virtual positions , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[5]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[6]  D. West.  Introduction to Graph Theory , 1995 .

[7]  Mike Rees,et al.  5. Statistics for Spatial Data , 1993 .

[8]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[9]  Miroslaw Malek,et al.  Prediction of Partitioning in Location-Aware Mobile Ad Hoc Networks , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[10]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[11]  Noel A Cressie,et al.  Statistics for Spatial Data. , 1992 .

[12]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[13]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[14]  Tomas Johansson,et al.  Reducing interference in ad hoc networks through topology control , 2005, DIALM-POMC '05.

[15]  L. Devroye.  THE EXPECTED SIZE OF SOME GRAPHS IN COMPUTATIONAL GEOMETRY , 1988 .

[16]  W..  Relative Neighborhood Graphs and Their Relatives , 2004 .