On a family of strong geometric spanners that admit local routing strategies

Details On a family of strong geometric spanners that admit local routing strategies On a family of strong geometric spanners that admit local routing strategies

2007-02-20

arxiv.org/abs/cs/0702117v3

Computer Science

Computational Geometry

Scientific paper

We introduce a family of directed geometric graphs, denoted $\paz$, that depend on two parameters $\lambda$ and $\theta$. For $0\leq \theta<\frac{\pi}{2}$ and ${1/2} < \lambda < 1$, the $\paz$ graph is a strong $t$-spanner, with $t=\frac{1}{(1-\lambda)\cos\theta}$. The out-degree of a node in the $\paz$ graph is at most $\lfloor2\pi/\min(\theta, \arccos\frac{1}{2\lambda})\rfloor$. Moreover, we show that routing can be achieved locally on $\paz$. Next, we show that all strong $t$-spanners are also $t$-spanners of the unit disk graph. Simulations for various values of the parameters $\lambda$ and $\theta$ indicate that for random point sets, the spanning ratio of $\paz$ is better than the proven theoretical bounds.

Affiliated with

Also associated with

No associations

Rating

On a family of strong geometric spanners that admit local routing strategies does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a family of strong geometric spanners that admit local routing strategies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a family of strong geometric spanners that admit local routing strategies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-84056