Compact and low delay routing labeling scheme for Unit Disk Graphs

  • Authors:

  • Chenyu Yan;Yang Xiang;Feodor F. Dragan

  • Affiliations:

  • Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, OH, USA;Department of Biomedical Informatics, The Ohio State University, Columbus, OH, USA;Algorithmic Research Laboratory, Department of Computer Science, Kent State University, Kent, OH, USA

  • Venue:
  • Computational Geometry: Theory and Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can assign each vertex of an n-vertex UDG G a compact O(log^2n)-bit label such that, given the label of a source vertex and the label of a destination, it is possible to compute efficiently, based solely on these two labels, a neighbor of the source vertex that heads in the direction of the destination. We prove that this routing labeling scheme has a constant hop route-stretch (= hop delay), i.e., for each two vertices x and y of G, it produces a routing path with h(x,y) hops (edges) such that h(x,y)=