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

Hongjie Du, Weili Wu, Shan Shan, Donghyun Kim, Wonjun Lee

Research output: Contribution to journalArticle

12 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)301-307
Number of pages7
JournalJournal of Combinatorial Optimization
Volume23
Issue number2
DOIs
Publication statusPublished - 2012 Feb 1

Fingerprint

Connected Dominating Set
Distributed Sensor
Distributed Networks
Parallel algorithms
Sensor networks
Sensor Networks
Clustering
Maximal Independent Set
Unit Disk Graph
Distributed Algorithms
Upper bound
Computing

Keywords

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

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics
  • Computational Theory and Mathematics
  • Computer Science Applications
  • Control and Optimization

Cite this

Constructing weakly connected dominating set for secure clustering in distributed sensor network. / Du, Hongjie; Wu, Weili; Shan, Shan; Kim, Donghyun; Lee, Wonjun.

In: Journal of Combinatorial Optimization, Vol. 23, No. 2, 01.02.2012, p. 301-307.

Research output: Contribution to journalArticle

Du, Hongjie ; Wu, Weili ; Shan, Shan ; Kim, Donghyun ; Lee, Wonjun. / Constructing weakly connected dominating set for secure clustering in distributed sensor network. In: Journal of Combinatorial Optimization. 2012 ; Vol. 23, No. 2. pp. 301-307.
@article{f42b084298e14c04bcb9bcbb1f8a8658,
title = "Constructing weakly connected dominating set for secure clustering in distributed sensor network",
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, Maximal independent set, Security, Unit disk graph, Weakly connected dominating set",
author = "Hongjie Du and Weili Wu and Shan Shan and Donghyun Kim and Wonjun Lee",
year = "2012",
month = "2",
day = "1",
doi = "10.1007/s10878-010-9358-y",
language = "English",
volume = "23",
pages = "301--307",
journal = "Journal of Combinatorial Optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

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

AU - Du, Hongjie

AU - Wu, Weili

AU - Shan, Shan

AU - Kim, Donghyun

AU - Lee, Wonjun

PY - 2012/2/1

Y1 - 2012/2/1

N2 - 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.

AB - 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.

KW - DSN

KW - Maximal independent set

KW - Security

KW - Unit disk graph

KW - Weakly connected dominating set

UR - http://www.scopus.com/inward/record.url?scp=84858866273&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84858866273&partnerID=8YFLogxK

U2 - 10.1007/s10878-010-9358-y

DO - 10.1007/s10878-010-9358-y

M3 - Article

VL - 23

SP - 301

EP - 307

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 2

ER -