Arkin, Esther M. and Fernández Anta, Antonio and Mitchell, Joseph S. B. and Mosteiro, Miguel A. (2011) Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions. In: The 23rd Canadian Conference on Computational Geometry (CCCG 2011), 10-12 August, 2011, Toronto, Canada.
PDF (Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions)
- Published Version
Download (268Kb) | Preview
Motivated by low energy consumption in geographic routing in wireless networks, there has been recent interest in determining bounds on the length of edges in the Delaunay graph of randomly distributed points. Asymptotic results are known for random networks in planar domains. In this paper, we obtain upper and lower bounds that hold with parametric probability in any dimension, for points distributed uniformly at random in domains with and without boundary. The results obtained are asymptotically tight for all relevant values of such probability and constant number of dimensions, and show that the overhead produced by boundary nodes in the plane holds also for higher dimensions. To our knowledge, this is the first comprehensive study on the lengths of long edges in Delaunay graphs.
|Item Type:||Conference or Workshop Papers (Paper)|
|Subjects:||Q Science > Q Science (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > T Technology (General)
T Technology > TA Engineering (General). Civil engineering (General)
T Technology > TK Electrical engineering. Electronics Nuclear engineering
|Divisions:||Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science|
|Depositing User:||Rebeca De Miguel|
|Date Deposited:||15 Feb 2012 14:05|
|Last Modified:||23 May 2012 10:12|
Actions (login required)