3d local algorithm for dominating sets of unit disk graphs

A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc networks use a dominating set of the nodes for routing. None of the existing algorithms has a constant approximation factor in a constant number of rounds in 3D. In this paper, we use the nodes' geometric locations to propose the first local, constant time algorithm that constructs a Dominating Set and Connected Dominating Set of a Unit Disk Graph (UDG) in a 3D environment. The approximation ratios of our algorithms are given.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opatrny
• Keywords: CCCG 2010, Computational Geometry, Connected Dominating Set, Constant Approximation Factor, Dominating Set