Planar Hop Spanners for Unit Disk Graphs.

Nicolas Catusse (1) , Victor Chepoi (2) , Yann Vaxès (2)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille
2 ACRO - Algorithmique, combinatoire et recherche opérationnelle

The simplest model of a wireless network graph is the Unit Disk Graph (UDG): an edge exists in UDG if the Euclidean distance between its endpoints is ≤ 1. The problem of constructing planar spanners of Unit Disk Graphs with respect to the Euclidean distance has received considerable attention from researchers in computational geometry and ad-hoc wireless networks. In this paper, we present an algorithm that, given a set X of terminals in the plane, constructs a planar hop spanner with constant stretch factor for the Unit Disk Graph defined by X. Our algorithm improves on previous constructions in the sense that (i) it ensures the planarity of the whole spanner while previous algorithms ensure only the planarity of a backbone subgraph; (ii) the hop stretch factor of our spanner is significantly smaller.

Mots clés: Planar spanner; Unit Disk Graph; Geometric Networks; Wireless Networks

Domaines: Géométrie algorithmique [cs.CG]; Réseaux et télécommunications [cs.NI]

Nicolas Catusse, Victor Chepoi, Yann Vaxès. Planar Hop Spanners for Unit Disk Graphs.. 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Movile Entities, Jul 2010, Bordeaux, France. pp 16-30, ⟨10.1007/978-3-642-16988-5_2⟩. ⟨hal-00949238⟩