Skip to main content
SpringerLink
Log in

Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The connected dominating set plays an important role in ad hoc wireless networking. Many constructions for approximating the minimum connected dominating set have been proposed in the literature. In this paper, we propose a new one with Steiner tree, which produces approximation solution within a factor of 6.8 from optimal. This approximation algorithm can also be implemented distributedly.

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

Similar content being viewed by others

References

  1. Alzoubi, K. M., Wan, P. -J., and Frieder, O. (2002) Message-optimal connected dominating sets in mobile ad hoc networks, Proceedings of the 3rd ACM International Symposium on Mobile ad hoc Networking and Computing, June 09–11, Lausanne, Switzerland.

  2. Bharghavan, V. and Das, B. Routing in ad hoc networks using minimum connected dominating sets, International Conference on Communication, Montreal, Canada, June 1997.

  3. D. Chen D.-Z. Du X. Hu G.-H. Lin L. Wang G. Xue (2000) ArticleTitleApproximations for Steiner trees with minimum number of Steiner points Journal of Global Optimization 18 17–33 Occurrence Handle10.1023/A:1008384012064

    Article  Google Scholar 

  4. Chen, Y. P. and Liestman, A. L. (2002), Approximating minimum size weakly connected dominating sets for clustering mobile ad hoc networks, Proceedings of the third ACM International Symposium on Mobile ad hoc Networking and Computing, June 09–11, Lausanne, Switzerland.

  5. Cadei, M., Cheng, M.X., Cheng, X. and Du, D.-Z. (2002), Connected domination in ad hoc wireless networks, Proceedings the Sixth International Conference on Computer Science and Informatics (CS& I’2002).

  6. X. Cheng X. Huang D. Li W. Wu D.-Z Du (2003) ArticleTitleA polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks Networks 42 202–208 Occurrence Handle10.1002/net.10097

    Article  Google Scholar 

  7. Deering, S., Farinacci, D., Jacobson, V., Lui, C. and Wei, L. (1994), An Architecture for Wide Area Multicast Routing, Proceedings of ACM SIGCOMM 1994, September 1994.

  8. Du, D. -Z., Wang, L. and Xu, B. (2001), The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points, COCOON’ 2001, pp. 509–518

  9. Eriksson, H. (1994), MBone: The Multicast Backbone, Communications of the ACM, August 1994.

  10. S. Guha S. Khuller (1998) ArticleTitleApproximation algorithms for connected dominating sets Algorithmica 20 IssueID4 374–387 Occurrence Handle10.1007/PL00009201

    Article  Google Scholar 

  11. Lin G.-H. and Xue G.L. (1999) Steiner tree problem with minimum number of Steiner points and bounded edge-length. Information Processing Letters 69:53–57

    Google Scholar 

  12. Ramamurthy, B., Iness J. and Mukherjee, B. (1997), Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN/MAN, Proceeding IEEE INFOCOM’97, pp. 261–268, April 1997.

  13. L. Ruan H. Du X. Jia W. Wu Y. Li K.-I. Ko (2004) ArticleTitleA greedy approximation for minimum connected dominating set Theoretical Computer Science 329 IssueID1–3 325–330 Occurrence Handle10.1016/j.tcs.2004.08.013

    Article  Google Scholar 

  14. Salhieh, A., Weinmann, J., Kochha, M. and Schwiebert, L. (2001), Power Efficient topologies for wireless sensor networks, ICPP’2001, pp. 156–163.

  15. Sivakumar, R., Das, B. and Bharghavan, V. (1998), An improved spine-based infrastructure for routing in ad hoc networks, IEEE Symposium on Computer and Communications, Athens, Greece, June, 1998.

  16. Stojmenovic, I., Seddigh, M. and Zunic, J. (2001), Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, Proceeding IEEE Hawaii International Conference on System Sciences, January 2001.

  17. Wan, P.-J., Alzoubi, K.M. and Frieder, O. (2002), Distributed construction of connected dominating set in wireless ad hoc networks, Proceedings of Infocom’2002.

  18. Wu J. and Li, H.L. (1991), On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, 55455, USA

    Manki Min & Scott C.-H. Huang

  2. Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong

    Hongwei Du & Xiaohua Jia

  3. 3M Center, Building 0235-03-F-08. St. Paul, MN, 55144, USA

    Christina Xiao Huang

  4. Department of Computer Science, University of Texas at Dallas, Richardson, Tx, 75083

    Weili Wu

Authors
  1. Manki Min
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongwei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaohua Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christina Xiao Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Scott C.-H. Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongwei Du.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Min, M., Du, H., Jia, X. et al. Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks. J Glob Optim 35, 111–119 (2006). https://doi.org/10.1007/s10898-005-8466-1

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-005-8466-1

Keywords

Search

Navigation