Skip to main content
SpringerLink
Log in

An efficient distributed algorithm for Connected Dominating Set construction in wireless sensor networks

  • Letters
  • Published:
Journal of Electronics (China)

Abstract

Efficient broadcasting protocols based on Connected Dominating Set (CDS) are frequently used; hence the entire broadcast domain is restricted to nodes in the CDS. This letter proves that a node must be a CDS node, if its neighbors with larger keys cannot cover it together. Then a simple distributed CDS construction algorithm is proposed, which is more effective than the existing algorithms in reducing the dominating set size and the computation complexity at the same time. Simulation results also confirm this, especially in relatively dense networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. I. F. Akyildiz, W. Su, Y. Sanakaasubramaniam, et al., Wireless sensor networks: A survey, IEEE Computer Networks, 40(2002)4, 102–114.

    Google Scholar 

  2. B. N. Clark, C. J. Colbourn, D. S. Johnson, Unit disk graphs, Discreate Mathematics, 86(1990), 165–177.

    Article  MATH  Google Scholar 

  3. I. Stojmenovic, M. Seddigh, J. Zunic, Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, IEEE Trans. on Parallel and Distributed Systems, 13(2002)1, 14–25.

    Article  Google Scholar 

  4. I. Stojmenovic, Comments and corrections to “Dominating sets and neighbor elimination based broad-casting algorithms in wireless networks”. IEEE Trans. on Parallel and Distributed Systems, 15(2004)11, 1054–1055.

    Article  Google Scholar 

  5. J. Wu, H. Li, A dominating set based routing scheme in Ad Hoc wireless networks. Proceeding of the International Workshop on Discrete Algorithms and methods (DIALM), Seattle, USA, 1999, 7–14.

  6. F. Dai, J. Wu, Distributed dominant pruning in Ad Hoc wireless networks. Proceeding of IEEE International Conf. on Communications (ICC’03), Anchorage, Alaska, May 2003. IEEE Communication Society, 2003, vol.1, 353–357.

    Google Scholar 

  7. F. Dai, J. Wu, An extended localized algorithm for connected dominating set formation in Ad Hoc wireless networks, IEEE Trans. on Parallel and Distributed Systems, 15(2004)10, 908–920.

    Article  Google Scholar 

  8. T. H. Cormen, C. E. Leiserson, R. L. Rivest, et al., Introduction to Algorithms. USA. McGraw Hill, 2001, ch.5.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Electronics & Information, Huazhong University of Science and Tech., 430074, Wuhan, China

    Yang Zongkai, Zhao Dasheng & Wang Yuming

  2. Department of Electrical & Electronic Engineering, University of Bristol, Bristol, UK

    He Jianhua

Authors
  1. Yang Zongkai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhao Dasheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wang Yuming
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. He Jianhua
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the National Natural Science Foundation of China (No.60202005).

Communication author: Zhao Dasheng, born in 1976, male, Ph.D. candidate. Department of Electronics & Information Engineering, Huazhong University of Science and Technology, Wuhan 430074, China.

About this article

Cite this article

Yang, Z., Zhao, D., Wang, Y. et al. An efficient distributed algorithm for Connected Dominating Set construction in wireless sensor networks. J. of Electron.(China) 22, 671–675 (2005). https://doi.org/10.1007/BF02687849

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02687849

Key words

Search

Navigation