We present local 1∈+∈ε approximation algorithms for the minimum dominating and the connected dominating set problems in location aware Unit Disk Graphs (UDGs). Our algorithms are local in the sense that the status of a vertex v in the output (i.e. whether or not v is part of the set to be computed) depends only on the vertices which are a constant number of edges (hops) away from v. This constant is independent of the size of the network. In our graph model we assume that each vertex knows its geographic coordinates in the plane (location aware nodes). Our algorithms give the best approximation ratios known for this setting. Moreover, the processing time that each vertex needs to determine whether or not it is part of the computed set is bounded by a polynomial in the number of vertices which are a constant number of hops away from it. We employ a new method for constructing the connected dominating set and we give the first analysis of trade-offs between approximation ratio and locality distance.

Additional Metadata
Persistent URL dx.doi.org/10.1007/978-3-540-93980-1_18
Citation
Wiese, A. (Andreas), & Kranakis, E. (2009). Local PTAS for dominating and connected dominating set in location aware unit disk graphs. doi:10.1007/978-3-540-93980-1_18