## Abstract

Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (or the unit disk) and connecting every two nodes if and only if their Euclidean distance is at most r. Let rcon = (Formula presented) be the known critical radius for connectivity when n → ∞. The restricted Delaunay graph RDG(G) is a subgraph of G with the following properties: it is a planar graph and a spanner of G, and in particular it contains all the short edges of the Delaunay triangulation of G. While in general graphs, the construction of RDG (G) requiresQ (n) messages, we show that when r = O(rcon) and G = G(n, r), then with high probability, RDG(G) can be constructed locally in one round of communication with (Formula presented) messages, and with only one-hop neighborhood information. This size of r proves that the existence of long Delaunay edges (an order larger than rcon) in the unit square (disk) does not significantly affect the efficiency with which good routing graphs can be maintained.

Original language | English |
---|---|

Pages (from-to) | 195-210 |

Number of pages | 16 |

Journal | Internet Mathematics |

Volume | 5 |

Issue number | 3 |

DOIs | |

State | Published - 1 Jan 2008 |

## ASJC Scopus subject areas

- Modeling and Simulation
- Computational Mathematics
- Applied Mathematics