Skip to main content
SpringerLink
Log in

An Approximation Algorithm for MCDS Construction in Ad Hoc Networks

  • Conference paper
Future Wireless Networks and Information Systems

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 143))

  • 2798 Accesses

Abstract

In wireless ad hoc networks, a minimum connected dominating set (MCDS) can be used as a virtual backbone to improve the performance of source allocation, enhance routing efficiency and prolong the system lifetime. In this paper, based on the relationships between a maximal independent set and a dominating set, adjacency matrix theory and greedy strategy, we propose an approximation algorithm MatrixMCDS for constructing MCDS in wireless ad hoc networks with small approximation ratio. We also give the correctness of proofs and complexity analysis of the proposed algorithm.

Support in part by National Science Foundation of China (No. 10971052) and Youth Foundation of Education Department of Hebei Province, (No. 2010260).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alzoubi, K.M.: Virtual backbone in wireless ad hoc networks. llinois Institute of Technology, USA (2004)

    Google Scholar 

  2. Cadei, M., Cheng, M.X., Cheng, X., Du, D.-Z.: Connected domination in ad hoc wireless networks. In: Proc. Sixth Internat. Conf. Computer Science and Informatics, CSI 2002 (2002)

    Google Scholar 

  3. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graph. Discrete Mathematices 86, 165–177 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Geng, S.-Y., Qu, W.-L., Wang, H.-P.: A course book of discrete mathematics. Beijing University Press, Beijing (2007)

    Google Scholar 

  5. Min, M., Du, H., Jia, X., Huang, C.X., Huang, S.C.-H., Wu, W.: Improving construction for connected dominating set with Steiner tree in wireless sensor networks. Journal of Global Optimization 35(1), 111–119 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., Ko, K.: A greedy approximation for minimum connected dominating set. Theoretical Computer Science 329, 325–330 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Shang, W., Yao, F., Wan, P.-J., Hu, X.: Algorithms for Minimum m-Connected k-Dominating Set Problem. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol. 4616, pp. 182–190. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Tang, Y., Zhou, M.-T.: Maximal independent set based distributed algorithm for minimum connected dominating set. Acta Electronic Sinica 35(5), 868–874 (2007)

    Google Scholar 

  9. Wang, S.-H.: Graph Theory. Science Press, Beijing (2005)

    Google Scholar 

  10. Wu, W.-L., Du, H.-W., Jia, X.-H., Li, Y.-S., Huang, S.C.-H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoretical Computer Science 352, 1–7 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics and Information College, Hebei Normal University, Shijiazhuang, 050016, P.R. China

    Haiyan Tian, Xinlu Zhang & Suogang Gao

  2. Hebei Key Laboratory of Computational Mathematics and Application, Shijiazhuang, 050016, P.R. China

    Haiyan Tian

  3. Information Engineering School, Shijiazhuang University of Economics, Shijiazhuang, 050031, P.R. China

    Yichao He

Authors
  1. Haiyan Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yichao He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xinlu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Suogang Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haiyan Tian .

Editor information

Editors and Affiliations

  1. , Wuhan Optical Valley Software Park, Wuhan University, Wuhan, 430073, China, People's Republic

    Ying Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Tian, H., He, Y., Zhang, X., Gao, S. (2012). An Approximation Algorithm for MCDS Construction in Ad Hoc Networks. In: Zhang, Y. (eds) Future Wireless Networks and Information Systems. Lecture Notes in Electrical Engineering, vol 143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27323-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27323-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27322-3

  • Online ISBN: 978-3-642-27323-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation