Constructing Connected Dominating Sets with Bounded Diameters inWireless Networks

Abstract

In wireless networks, due to the lack of fixed infrastructure or centralized management, a connected dominating set (CDS) of the graph representing the network is an optimum candidate to serve as the virtual backbone of a wireless network. However, constructing a minimum CDS is NP-hard. Furthermore, almost all of the existing CDS construction algorithms neglect the diameter of a CDS, which is an important factor. In this paper, we investigate the problem of constructing a CDS with a bounded diameter in wireless networks and propose a heuristic algorithm, connected dominating sets with bounded diameters (CDS-BD), with constant performance ratios for both the size and diameter of the constructed CDS.