Constrained Routing Between Non-Visible Vertices

by   Prosenjit Bose, et al.

In this paper we study local routing strategies on geometric graphs. Such strategies use geometric properties of the graph like the coordinates of the current and target nodes to route. Specifically, we study routing strategies in the presence of constraints which are obstacles that edges of the graph are not allowed to cross. Let P be a set of n points in the plane and let S be a set of line segments whose endpoints are in P, with no two line segments intersecting properly. We present the first deterministic 1-local O(1)-memory routing algorithm that is guaranteed to find a path between two vertices in the visibility graph of P with respect to a set of constraints S. The strategy never looks beyond the direct neighbors of the current node and does not store more than O(1)-information to reach the target. We then turn our attention to finding competitive routing strategies. We show that when routing on any triangulation T of P such that S⊆ T, no o(n)-competitive routing algorithm exists when the routing strategy restricts its attention to the triangles intersected by the line segment from the source to the target (a technique commonly used in the unconstrained setting). Finally, we provide an O(n)-competitive deterministic 1-local O(1)-memory routing algorithm on any such T, which is optimal in the worst case, given the lower bound.


page 1

page 2

page 3

page 4


Routing on the Visibility Graph

We consider the problem of routing on a network in the presence of line ...

Expected Complexity of Routing in Θ 6 and Half-Θ 6 Graphs

We study online routing algorithms on the Θ6-graph and the half-Θ6-graph...

Local Routing in Sparse and Lightweight Geometric Graphs

Online routing in a planar embedded graph is central to a number of fiel...

Topology and Routing Problems: The Circular Frame

In this work, we solve the problem of finding non-intersecting paths bet...

Combinatorics of Beacon-based Routing in Three Dimensions

A beacon is a point-like object which can be enabled to exert a magnetic...

Generalized Sweeping Line Spanners

We present sweeping line graphs, a generalization of Θ-graphs. We show t...

Efficient Routing Algorithm Design for Large DetNet

Deterministic Networking (DetNet) is a rising technology that offers det...

Please sign up or login with your details

Forgot password? Click here to reset