Distributed construction of connected dominating set in wireless ad hoc networks

Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoe networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. In this paper, we first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithm can not guarantee to generate a CDS of small size. Their message complexities can be as high as O (n(2)), and their time complexities may also be as large as O (n(2)) and O (n(3)). We then present our own distributed algorithm that outperforms the existing algorithms. This algorithm has an approximation factor of at most 8, O (n) time complexity and O (n log n) message complexity. By establishing the Omega (n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, our algorithm is thus message-optimal.