Algorithmica

, Volume 61, Issue 4, pp 1000–1021

Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs

Article

Abstract

Connected dominating set (CDS) in unit disk graphs has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in unit disk graphs have been proposed in the literature. The majority of these algorithms follow a general two-phased approach. The first phase constructs a dominating set, and the second phase selects additional nodes to interconnect the nodes in the dominating set. In the performance analyses of these two-phased algorithms, the relation between the independence number α and the connected domination number γc of a unit-disk graph plays the key role. The best-known relation between them is \(\alpha\leq3\frac{2}{3}\gamma_{c}+1\). In this paper, we prove that α≤3.4306γc+4.8185. This relation leads to tighter upper bounds on the approximation ratios of two approximation algorithms proposed in the literature.

Keywords

Wireless ad hoc networks Connected dominating set Approximation algorithm Geometric analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Computer ScienceCity University of Hong KongHong KongHong Kong SAR
  2. 2.Department of Computer ScienceIllinois Institute of TechnologyChicagoUSA

Personalised recommendations