Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alzoubi, K., Wan, P., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: MobiHoc 2002: Proceedings of the 3rd ACM international symposium on Mobile Ad Hoc Networking & Computing, pp. 157–164. ACM Press, New York (2002)
Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Computational Geometry. Theory and Applications 9(1-2), 3–24 (1998)
Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4), 202–208 (2003)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1-3), 165–177 (1990)
Czyzowicz, J., Dobrev, S., Fevens, T., González-Aguilar, H., Kranakis, E., Opatrny, J., Urrutia, J.: Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 158–169. Springer, Heidelberg (2008)
Gfeller, B., Vicari, E.: A faster distributed approximation scheme for the connected dominating set problem for growth-bounded graphs. In: Kranakis, E., Opatrny, J. (eds.) ADHOC-NOW 2007. LNCS, vol. 4686, pp. 59–73. Springer, Heidelberg (2007)
Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms 26(2), 238–274 (1998)
Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proc. 5th Ann. ACM Symp. Theory Computing, NY, pp. 38–49. ACM Press, New York (1973); Also in J. Comput. Syst. Sci. 9(3), 256-278 (1974)
Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 273–287. Springer, Heidelberg (2005)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit disk graph approximation. In: DIALM-POMC 2004: Proceedings of the 2004 joint workshop on Foundations of mobile computing, pp. 17–23. ACM Press, New York (2004)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pp. 60–68 (2005)
Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM Symposium on Discrete Algorithms, pp. 980–989. ACM Press, New York (2006)
Kuhn, F., Nieberg, T., Moscibroda, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: DIALM-POMC 2005: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing, pp. 97–103. ACM Press, New York (2005)
Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193–201 (1992)
Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(1), 59–68 (1995)
Nieberg, T., Hurink, J.L.: A PTAS for the minimum dominating set problem in unit disk graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 296–306. Springer, Heidelberg (2006)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 1997), New York, May 1997, pp. 475–484. Association for Computing Machinery (1997)
Wiese, A., Kranakis, E.: Local ptas for dominating and connected dominating set in location aware unit disk graphs. Technical Report TR-07-17, Carleton University, School of Computer Science, Ottawa (December 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiese, A., Kranakis, E. (2009). Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs. In: Bampis, E., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2008. Lecture Notes in Computer Science, vol 5426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93980-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-93980-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93979-5
Online ISBN: 978-3-540-93980-1
eBook Packages: Computer ScienceComputer Science (R0)