New distributed algorithm for connected dominating set in wireless ad hoc networks

Connected dominating set (CDs) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the literature for minimum CDS. We first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms can not guarantee to generate a CDs of small size. Their message complexities can be as high as O(n/sup 2/), and their time complexities may also be as large as O(n/sup 2/) and O(n/sup 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 /spl Omega/(n log n) lower bound on the message complexity of any distributed algorithm for nontrivial CDs, our algorithm is thus message-optimal.