Journal of Combinatorial Optimization

, Volume 23, Issue 2, pp 301–307 | Cite as

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

  • Hongjie Du
  • Weili Wu
  • Shan Shan
  • Donghyun Kim
  • Wonjun Lee
Article

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.

Keywords

DSN Security Weakly connected dominating set Maximal independent set Unit disk graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 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 CrossRefGoogle Scholar
  3. 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
  4. Dunbar JE, Grossman JW, Hattingh JH, Hedetniemi ST, McRae AA (1997) On weakly connected domination in graphs. Discrete Math 167–168:261–269 MathSciNetCrossRefGoogle Scholar
  5. 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 CrossRefGoogle Scholar
  6. 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 MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Hongjie Du
    • 1
  • Weili Wu
    • 1
  • Shan Shan
    • 1
  • Donghyun Kim
    • 2
  • Wonjun Lee
    • 3
  1. 1.Dept. of Computer ScienceUniv. of Texas at DallasRichardsonUSA
  2. 2.Department of Mathematics and Computer ScienceNorth Carolina Central UniversityDurhamUSA
  3. 3.Division of Computer and Communication Engineering, College of Information and CommunicationKorea UniversitySeoulRepublic of Korea

Personalised recommendations