A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf
.
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
[chapter]
2009
Lecture Notes in Computer Science
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 2 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
doi:10.1007/978-3-642-03367-4_49
fatcat:jxxwvp6qwvgjlec2iunrsehfg4