Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs

We look at the problem of coloring locally specially constructed spanners of unit disk graphs. First we present a local approximation algorithm for the vertex coloring problem in Unit Disk Graphs (UDGs) which uses at most four times as many colors as an optimal solution requires. Next we look at the colorability of spanners of UDGs. In particular we present a local algorithm for constructing a 4-colorable spanner of a unit disk graph. The output consists of the spanner and the 4-coloring. The computed spanner also has the properties that it is planar, the degree of a vertex in the spanner is at most 5 and the angles between two edges are at least π/3. By enlarging the locality distance (i.e. the size of the neighborhood which a vertex has to explore in order to compute its color) we can ensure the total weight of the spanner to be arbitrarily close to the weight of a minimum spanning tree. We prove that a local algorithm cannot compute a bipartite spanner of a unit disk graph and therefore our algorithm needs at most one color more than any local algorithm for the task requires. Moreover, we prove that there is no local algorithm for 3-coloring UDGs or spanners of UDGs, even if the 3-colorability of the graph (or the spanner respectively) is guaranteed in advance.

[1]  Xiang-Yang Li,et al.  Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks , 2003, DIALM-POMC '03.

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

[3]  R. Möhring Algorithmic Aspects of Comparability Graphs and Interval Graphs , 1985 .

[4]  Xiang-Yang Li,et al.  Applications of k-local MST for topology control and broadcasting in wireless ad hoc networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

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

[6]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[7]  Jorge Urrutia,et al.  Local 7-coloring for planar subgraphs of unit disk graphs , 2011, Theor. Comput. Sci..

[8]  M.J.P. Peeters,et al.  On coloring j-unit sphere graphs , 1991 .

[9]  Joachim Gudmundsson,et al.  Constructing Plane Spanners of Bounded Degree and Low Weight , 2002, ESA.

[10]  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.

[11]  Jorge Urrutia,et al.  Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges , 2006, LATIN.

[12]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[13]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[14]  David Eppstein,et al.  Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.

[15]  A. Gräf,et al.  On Coloring Unit Disk Graphs , 1998, Algorithmica.

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

[17]  Jorge Urrutia,et al.  Local solutions for global problems in wireless networks , 2007, J. Discrete Algorithms.

[18]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

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

[20]  Giri Narasimhan,et al.  Approximating the Stretch Factor of Euclidean Graphs , 2000, SIAM J. Comput..