Routing on heavy path WSPD spanners

Abstract

In this article, we present a construction of a spanner on a set of n points in $R^d$ that we call a heavy path WSPD spanner. The construction is parameterized by a constant $s>2$ called the separation ratio. The size of the graph is $O\left(s^{d}n\right)$ and the spanning ratio is at most $1+2/s+2/(s-1)$. We also show that this graph has a hop spanning ratio of at most $2\lg n+1$.

We present a memoryless local routing algorithm for heavy path WSPD spanners. The routing algorithm requires a vertex v of the graph to store $O(\mathrm{deg}(v)\log n)$ bits of information, where $\mathrm{deg}\left(v\right)$ is the degree of v. The routing ratio is at most $1+4/s+1/(s-1)$ and at least $1+4/s$ in the worst case. The number of edges on the routing path is bounded by $2\lg n+1$.

We then show that the heavy path WSPD spanner can be constructed in metric spaces of bounded doubling dimension. These metric spaces have been studied in computational geometry as a generalization of Euclidean space. We show that, in a metric space with doubling dimension λ, the heavy path WSPD spanner has size $O\left(s^{\lambda }n\right)$ where s is the separation ratio. The spanning ratio and hop spanning ratio are the same as in the Euclidean case.

Finally, we show that the local routing algorithm works in the bounded doubling dimension case. The vertices require the same amount of storage, but the routing ratio becomes at most $1+(2+\frac{\tau }{\tau -1})/s+1/(s-1)$ in the worst case, where $\tau \ge 11$ is a constant related to the doubling dimension.