Mobile Networks and Applications

, Volume 9, Issue 2, pp 141–149

Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

  • Peng-Jun Wan
  • Khaled M. Alzoubi
  • Ophir Frieder


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(n2), and their time complexities may also be as large as O(n2) and O(n3). 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 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    V. Bharghavan and B. Das, Routing in ad hoc networks using minimum connected dominating sets, in: Proc. of International Conference on Communications'97, Montreal, Canada (June 1997) pp. 376–380.Google Scholar
  2. [2]
    J. Burns, A formal model for message passing systems, Technical Report TR-91, Computer Science Department, Indiana University (May 1980).Google Scholar
  3. [3]
    G. Chen and I. Stojmenovic, Clustering and routing in wireless ad hoc networks, Technical Report TR-99-05, Computer Science, SITE, University of Ottawa (June 1999).Google Scholar
  4. [4]
    V. Chvátal, A greedy heuristic for the set-covering problem, Mathematics of Operation Research 4(3) (1979) 233–235.Google Scholar
  5. [5]
    I. Cidon and O. Mokryn, Propagation and leader election in multihop broadcast environment, in: Proc. of 12th International Symposium on DIStributed Computing (DISC98), Greece (September 1998) pp. 104–119.Google Scholar
  6. [6]
    B.N. Clark, C.J. Colbourn and D.S. Johnson, Unit disk graphs, Discrete Mathematics 86 (1990) 165–177.Google Scholar
  7. [7]
    B. Das, R. Sivakumar and V. Bharghavan, Routing in ad-hoc networks using a spine, in: Proc. of International Conference on Computers and Communications Networks '97, Las Vegas, NV (September 1997).Google Scholar
  8. [8]
    M. Gerla and J. Tsai, Multicluster, mobile, multimedia radio network, ACM-Baltzer Journal of Wireless Networks 1(3) (1995) 255–265.Google Scholar
  9. [9]
    C.R. Lin and M. Gerla, Adaptive clustering for mobile wireless networks, IEEE Journal on Selected Areas in Communications 15(7) (1997) 1265–1275.Google Scholar
  10. [10]
    R. Sivakumar, B. Das and V. Bharghavan, An improved spine-based infrastructure for routing in ad hoc networks, in: Proc. of IEEE Symposium on Computers and Communications '98, Athens, Greece (June 1998).Google Scholar
  11. [11]
    I. Stojmenovic, M. Seddigh and J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, in: Proc. of IEEE Hawaii Int. Conf. on System Sciences (January 2001).Google Scholar
  12. [12]
    J. Wu and H.L. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, in: Proc. of Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (1999) pp. 7–14.Google Scholar

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • Peng-Jun Wan
    • 1
  • Khaled M. Alzoubi
    • 2
  • Ophir Frieder
    • 1
  1. 1.Department of Computer ScienceIllinois Institute of TechnologyChicagoUSA
  2. 2.Computer Science DepartmentSaint Xavier UniversityChicagoUSA

Personalised recommendations