Mobile Networks and Applications

, Volume 9, Issue 2, pp 141-149

First online:

Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

  • Peng-Jun WanAffiliated withDepartment of Computer Science, Illinois Institute of Technology
  • , Khaled M. AlzoubiAffiliated withComputer Science Department, Saint Xavier University
  • , Ophir FriederAffiliated withDepartment of Computer Science, Illinois Institute of Technology

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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. In this paper, we first reinvestigate their performances. None of these algorithms have constant approximation factors. Thus these algorithms cannot 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(nlog n) message complexity. By establishing the Ω(nlog n) lower bound on the message complexity of any distributed algorithm for nontrivial CDS, our algorithm is thus message-optimal.

wireless ad hoc networks distributed algorithm connected dominating set independent set leader election spanning tree