Impact of Locality on Location Aware Unit Disk Graphs

Due to their importance for studies oi wireless networks, recent years have seen a surge of activity on the design of local algorithms for the solution of a variety of network tasks. We study the behaviour of algorithms with very low localities. Despite of this restriction we propose local constant ratio approximation algorithms for solving minimum dominating and connected dominating set, maximum independent set and minimum vertex cover in location aware Unit Disk Graphs. We also prove the first ever lower bounds for local algorithms for these problems with a given locality in the location aware setting.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[3]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

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

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

[6]  Moni Naor,et al.  What can be computed locally? , 1993, STOC.

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

[8]  J. Håstad.  Clique is hard to approximate within n 1-C , 1996 .

[9]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[10]  Johan Håstad,et al.  Clique is hard to approximate within n1-epsilon , 1996, Electron. Colloquium Comput. Complex..

[11]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[12]  Jonas Holmerin,et al.  Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.

[13]  Paul J.M. Havinga,et al.  Collaborative communication protocols for wireless sensor networks , 2003 .

[14]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[15]  Johann Hurink,et al.  A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs , 2004, WG.

[16]  Roger Wattenhofer,et al.  Local approximation schemes for ad hoc and sensor networks , 2005, DIALM-POMC '05.

[17]  Johann Hurink,et al.  A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs , 2005, WAOA.

[18]  E. Kranakis,et al.  LOCAL PTAS FOR DOMINATING AND CONNECTED DOMINATING SET IN LOCATION AWARE UDGS , 2007 .

[19]  Jorge Urrutia,et al.  Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes , 2008, LATIN.

[20]  Beat Gfeller,et al.  A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs , 2007, Ad Hoc Sens. Wirel. Networks.