6 research outputs found
An Analysis of Planarity in Face-Routing
In this report we investigate the limits of routing according to left- or right-hand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits next in counter-clockwise order in the network graph. When used to recover from greedy routing failures, LHR guarantees success if implemented over planar graphs. This is often referred to as face or geographic routing. In the current body of knowledge it is known that if planarity is violated then LHR is guaranteed only to eventually return to the point of origin. Our work seeks to understand why a non-planar environment stops LHR from making delivery guarantees. Our investigation begins with an analysis to enumerate all node con gurations that cause intersections. A trace over each con guration reveals that LHR is able to recover from all but a single case, the `umbrella' con guration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PDLP) that can guarantee delivery over non-planar graphs using standard face-routing techniques. As the name implies, the protocol detects and circumvents the `bad' links that hamper LHR. The goal of this work is to maintain routing guarantees while disturbing the network graph as little as possible. In doing so, a new starting point emerges from which to build rich distributed protocols in the spirit of protocols such as CLDP and GDSTR
Spanners of Additively Weighted Point Sets
We study the problem of computing geometric spanners for (additively)
weighted point sets. A weighted point set is a set of pairs where
is a point in the plane and is a real number. The distance between two
points and is defined as . We show
that in the case where all are positive numbers and for all (in which case the points can be seen as
non-intersecting disks in the plane), a variant of the Yao graph is a
-spanner that has a linear number of edges. We also show that the
Additively Weighted Delaunay graph (the face-dual of the Additively Weighted
Voronoi diagram) has constant spanning ratio. The straight line embedding of
the Additively Weighted Delaunay graph may not be a plane graph. We show how to
compute a plane embedding that also has a constant spanning ratio
Prohibitive-link Detection and Routing Protocol
Abstract In this paper we investigate the limits of routing according to left-or righthand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits next in counter-clockwise order in the network graph. When used to recover from greedy routing failures, LHR guarantees success if implemented over planar graphs. We note, however, that if planarity is violated then LHR is only guaranteed to eventually return to the point of origin. Our work seeks to understand why. An enumeration and analysis of possible intersections leads us to propose the Prohibitive-link Detection and Routing Protocol (PDRP) that can guarantee delivery over non-planar graphs. As the name implies, the protocol detects and circumvents the 'bad' links that hamper LHR. Our implementation of PDRP in TinyOS reveals the same level of service as face-routing protocols despite preserving most intersecting links in the network
Geometric Spanners with Applications in Wireless Networks
In this paper we investigate the relations between spanners, weak spanners, and power spanners in R D for any dimension D and apply our results to topology control in wireless networks. For c β R, a c-spanner is a subgraph of the complete Euclidean graph satisfying the condition that between any two vertices there exists a path of length at most c-times their Euclidean distance. Based on this ability to approximate the complete Euclidean graph, sparse spanners have found many applications, e.g., in FPTAS, geometric searching, and radio networks. In a weak c-spanner, this path may be arbitrarily long, but must remain within a disk or sphere of radius c-times the Euclidean distance between the vertices. Finally in a c-power spanner, the total energy consumed on such a path, where the energy is given by the sum of the squares of the edge lengths on this path, must be at most c-times the square of the Euclidean distance of the direct edge or communication link. While it is known that any c-spanner is also both a weak C1-spanner and a C2-power spanner for appropriate C1,C2 depending only on c but not on the graph under consideration, we show that the converse is not true: there exists a family of c1-power spanners that are not weak C-spanners and also a family of weak c2-spanners that are not C-spanners for any fixed C. However a main result of this pape