Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs


In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in wireless ad hoc and sensor networks, where the coverage area of nodes are disks with different radii. We derive the size relationship of any maximal independent set and the minimum… (More)
DOI: 10.1109/ICDCS.2008.39


5 Figures and Tables