Skip to main content
SpringerLink
Log in

Constructing weakly connected dominating set for secure clustering in distributed sensor network

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

Abstract

Secure clustering problem plays an important role in distributed sensor networks. Weakly Connected Dominating Set (WCDS) is used for solving this problem. Therefore, computing a minimum WCDS becomes an important topic of this research. In this paper, we compare the size of Maximal Independent Set (MIS) and minimum WCDS in unit disk graph. Our analysis shows that five is the least upper bound for this ratio. We also present a distributed algorithm to produce a weakly connected MIS within a factor 5 from the minimum WCDS.

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

  • Alzoubi KM, Wan P-J, Frieder O (2003) Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks. In: ICDCS ’03: Proceedings of the 23rd international conference on distributed computing systems 96.

    Google Scholar 

  • Chen YP, Liestman AL (2002) Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: MobiHoc ’02: Proceedings of the 3rd ACM international symposium on mobile ad hoc networking & computing, pp 165–172

    Chapter  Google Scholar 

  • Dubhashi D, Mei A, Panconesi A, Radhakrishnan J, Srinivasan A (2003) Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. In: SODA ’03: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, pp 717–724

    Google Scholar 

  • Dunbar JE, Grossman JW, Hattingh JH, Hedetniemi ST, McRae AA (1997) On weakly connected domination in graphs. Discrete Math 167–168:261–269

    Article  MathSciNet  Google Scholar 

  • Pathan AK, Hong CS (2009) Weakly connected dominating set-based secure clustering and operation in distributed sensor networks. Int J Commun Netw Distrib Syst 3(2):175–195

    Article  Google Scholar 

  • Wu W, Du H, Jia X, Li Y, Huang SC-H (2006) Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor Comput Sci 352(1–3):1–7

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Univ. of Texas at Dallas, Richardson, USA

    Hongjie Du, Weili Wu & Shan Shan

  2. Department of Mathematics and Computer Science, North Carolina Central University, 1801 Fayetteville St., Durham, NC 27707, USA

    Donghyun Kim

  3. Division of Computer and Communication Engineering, College of Information and Communication, Korea University, Seoul, Republic of Korea

    Wonjun Lee

Authors
  1. Hongjie Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shan Shan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Donghyun Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Wonjun Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wonjun Lee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Du, H., Wu, W., Shan, S. et al. Constructing weakly connected dominating set for secure clustering in distributed sensor network. J Comb Optim 23, 301–307 (2012). https://doi.org/10.1007/s10878-010-9358-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-010-9358-y

Keywords

Search

Navigation