Skip to main content
SpringerLink
Log in
Book cover

International Conference on Grid and Cooperative Computing

GCC 2003: Grid and Cooperative Computing pp 719–722Cite as

A Heuristic Algorithm for Minimum Connected Dominating Set with Maximal Weight in Ad Hoc Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3033))

Abstract

Routing based on a minimum connected dominating set (MCDS) is a promising approach in mobile ad hoc networks, where the search space for a route is reduced to nodes in the set (also called gateway nodes). This paper introduces MWMCDS, a simple and efficient heuristic algorithm for calculating MCDS with maximal weight. The choiceness based on maximal weight of gateway nodes guarantees that the most suitable nodes have been chosen for the role of gateway nodes so that they can properly coordinate all the other nodes. As a result, the method can keep stability of the MCDS and provide a high effective communication base for broadcast and routing operation in the whole network.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alzoubi, K.M., Wan, P.J., Frieder, O.: New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks. In: Proc.35th Hawaii Int’l Conf. System Sciences, pp. 3881–3887 (2002)

    Google Scholar 

  2. Basagni, S.: Finding a Maximal Weighted Independent Set in Wireless Networks. Telecommunication Systems 18(1-3), 155–168 (2001)

    Article  MATH  Google Scholar 

  3. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Algorithmica 20(4), 374–387 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Lim, H., Kim, C.: Flooding in Wireless Ad Hoc Networks. Computer Communications 24, 353–363 (2001)

    Article  Google Scholar 

  6. Royer, E.M., Toh, C.K.: A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks. IEEE Personal Comm. 4, 46–55 (1999)

    Article  Google Scholar 

  7. Sinha, P., Sivakumar, R., Bharghavan, V.: Enhancing ad hoc routing with dynamic virtual infrastructures. INFOCOM 3, 1763–1772 (2001)

    Google Scholar 

  8. Wu, J., Li, H.: A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks. Telecomm. Systems, A special issue on Wireless Networks 18, 1–3 (2001)

    MATH  Google Scholar 

  9. Wu, J.: Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links. IEEE Trans. On Parallel and Distributed System 13(9), 866–881 (2002)

    Article  Google Scholar 

  10. Wei, P., Xi-Cheng, L.: A Novel Distributed Approximation Algorithm for Minimum Connected Dominating Set. Chinese J. Computers 24(3), 254–258 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering & Automation, Tianjin University, Tianjin, 300072

    Xinfang Yan, Yugeng Sun & Yanlin Wang

  2. College of Information Engineering, Zhengzhou University, Zhengzhou, 450052

    Xinfang Yan

Authors
  1. Xinfang Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yugeng Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yanlin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiatong University, 80 Dongcuan Road, 200240, Shanghai, China

    Minglu Li

  2. Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA

    Xian-He Sun

  3. Department. of Computer Science, Shanghai Jiaotong University, 1954 HuaShan Road, 200030, Shanghai, P.R. China

    Qianni Deng

  4. Department of Computer Science, College of Liberal Arts and Science, University of Iowa, IA 52242, Iowa City, USA

    Jun Ni

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yan, X., Sun, Y., Wang, Y. (2004). A Heuristic Algorithm for Minimum Connected Dominating Set with Maximal Weight in Ad Hoc Networks. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_116

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24680-0_116

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21993-4

  • Online ISBN: 978-3-540-24680-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation