Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs

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(log2 n)-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) ≤ 3·dG(x, y)+12, where dG(x, y) is the hop distance between x and y in G. To the best of our knowledge, this is the first compact routing scheme for UDGs which not only guaranties delivery but has a low hop delay and polylog label size. Furthermore, our routing labeling scheme has a constant length route-stre...

• Type: Conference
• Year: 2009
• Where: WADS
• Authors: Chenyu Yan, Yang Xiang, Feodor F. Dragan
• Keywords: Algorithms, Labeling Scheme, Routing, Source Vertex, WADS 2009