Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4957 LNCS, Issue , 2008, Pages 158-169

  Czyzowicz, J ^a   Dobrev, S ^b   Fevens, T ^c   Gonzalez Aguilar H ^d   Kranakis, E ^e   Opatrny, J ^c   Urrutia, J ^f  

^a UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

^c Dept of Electrical and Computer Engineering   (Canada)

^d CENTRO DE INVESTIGACIÓN EN MATEMÁTICAS   (Mexico)

^e CARLETON UNIVERSITY   (Canada)

^f Área de la Investigación Cientifica   (Mexico)

Author keywords

Approximation factor; Connected dominating set; Dominating set; Local algorithm; Location awareness; Unit disk graph

Indexed keywords

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION MAKING; RADIO BROADCASTING; ROUTING PROTOCOLS; SET THEORY; CHLORINE COMPOUNDS; DISKS (STRUCTURAL COMPONENTS); GRAPH THEORY; MOBILE TELECOMMUNICATION SYSTEMS; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION FACTOR; CONNECTED DOMINATING SET; DOMINATING SET; LOCATION AWARENESS; UNIT DISK GRAPH; APPROXIMATION BOUNDS; CONNECTED DOMINATING SETS; DETERMINISTIC ALGORITHMS; DOMINATING SETS; INFORMATICS; LATIN AMERICAN; LOCAL ALGORITHM; LOCAL ALGORITHMS; LOCATION-AWARE; NUMBER OF HOPS; TIME COMPLEXITIES; UNIT DISK GRAPHS;

GRAPH THEORY; AD HOC NETWORKS;

EID: 43049127812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78773-0_14     Document Type: Conference Paper

References (29)

1. Alzoubi, K.M., Wan, P.-.J., Frieder, O.: Message-optimal connected-dominatingset construction for routing in mobile ad hoc networks. In: MOBIHOC 2002, pp. 157-164 (2002)
2. Aspnes, J., Bush, C., Dolev, S., Fatouroum, P., Georgiou, C., Shvartsman, A., Spiralis, P., Wattenhofer, R.: Eight open problems in distributed computing. Bulletin of the European Association for Theoretical Computer Science 90(109) (October 2006) Columns: Distributed Computing.
3. Awerblich, B., Peleg, D.: Sparse partitions (extended abstract). In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 503-513 (1990)
4. Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Computational Geometry: Theory and Applications 9, 3 24 (1998)
5. Chavez, E., Dobrev, S., Kranakis, E., Opatrny, J., Stacho, L., Urrutia, J.: Local construction of planar spanners in unit disk graphs with irregular transmission ranges. In: Correa, J.R., Hevia, A., Kiwi, M.A. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 286-297. Springer, Heidelberg (2006)
6. Cheng, X., Huang, X., Li, D., Du, D.-Z.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42, 202-208 (2003)
7. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86, 165-177 (1990)
8. Dessmark, A., PeIc, A.: Broadcasting in geometric radio networks. Journal of Discrete Algorithms 5, 187-201 (2007)
9. Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing 16, 121-163 (2003)
10. Funke, S., Kesselman, A., Meyer, U., Segal, M.: A simple improved distributed algorithm for minimum eds in unit disk graphs. ACM Transactions on Sensor Networks 2(3), 444-453 (2006)
11. 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. Journal of Algorithms 26(2), 238-274 (1998)
12. Irving, R.W.: On approximating the minimum independent dominating set. Information Processing Letters 37, 197 200 (1991)
13. Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Discrete Mobile Centers. Discrete & Computational Geometry 30(1), 45-63 (2001)
14. Jia, L., Rajaraman, R., Suel, R.: An efficient distributed algorithm, for constructing small dominating sets. Distributed Computing 14, 193-205 (2002)
15. Johnson, D.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9, 256-278 (1974)
16. Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. Distributed Computing 17(4), 303-310 (2005)
17. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: 23th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 300-309 (2004)
18. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Unit disk graph approximation. In: DialM: Proceedings of the Discrete Algorithms and Methods for Mobile Computing & Communications; later DIALM-POMC Joint Workshop on Foundations of Mobile Computing, pp. 17-23 (2004)
19. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: DialM: Proceedings of the Discrete Algorithms and Methods for Mobile Computing & Communications; later DIALMPOMC Joint Workshop on Foundations of Mobile Computing, pp. 97-103 (2005)
20. Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: 24th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 60-68 (2005)
21. Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: SODA, pp. 980 989. ACM Press, New York (2006)
22. Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing 21(1), 193-201 (1992)
23. Luby, M.: A simple parallel algorithm, for the maximal independent set problem. In: Proc. 17th Annual ACM Symposium on Theory of Computing (STOCS), May 1985, pp. 1-10 (1985)
24. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM 41, 960-981 (1994)
25. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Geometry based heuristics for unit disk graphs. ArXiv Mathematics e-prints (1994)
26. Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J. on Computing 24, 1259-1277 (1995)
27. Nieberg, T., Hurink, J.: A PTAS for the minimum dominating set problem in unit disk graphs. In: Approximation and Online Algorithms, pp. 296-306 (2006)
28. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)
29. Wang, Y., Li, X.: Localized construction of bounded degree and planar spanner for wireless ad hoc networks. In: Proc. of the 2003 joint workshop on Foundations of mobile computing (DIALM-POMC 2003), pp. 59-68. ACM Press, New York (2003)