Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph

We give a new local test, called a Half-Space Proximal or HSP test, for extracting a sparse directed or undirected subgraph of a given unit disk graph. The HSP neighbors of each vertex are unique, given a fixed underlying unit disk graph. The HSP test is a fully distributed, computationally simple algorithm that is applied independently to each vertex of a unit disk graph. The directed spanner obtained by this test is shown to be strongly connected, has out-degree at most six, its dilation is at most 2π+1, contains the minimum weight spanning tree as its subgraph and, unlike the Yao graph, it is rotation invariant. Since no coordinate assumption is needed to determine the HSP nodes, the test can be applied in any metric space.

[1]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[2]  Jorge Urrutia,et al.  Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks , 2004, SIROCCO.

[3]  Xiang-Yang Li,et al.  Efficient construction of low weighted bounded degree planar spanner , 2004, Int. J. Comput. Geom. Appl..

[4]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[5]  Xiang-Yang Li,et al.  Sparse power efficient topology for wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[6]  Roger Wattenhofer,et al.  Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.

[7]  Xiang-Yang Li,et al.  Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[8]  Lali Barrière,et al.  Robust position-based routing in wireless ad hoc networks with irregular transmission ranges , 2003, Wirel. Commun. Mob. Comput..

[9]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[10]  Jie Wu,et al.  Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks , 2004, Cluster Computing.

[11]  Carl Gutwin,et al.  Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..

[12]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[13]  Michiel H. M. Smid,et al.  Euclidean spanners: short, thin, and lanky , 1995, STOC '95.

[14]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[15]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[16]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[17]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[18]  Xiang-Yang Li,et al.  Efficient Construction of Low Weight Bounded Degree Planar Spanner , 2003, COCOON.

[19]  Lali Barrière,et al.  Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges , 2001, DIALM '01.

[20]  Godfried T. Toussaint,et al.  Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.

[21]  Leonidas J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2005 .