Constructing weakly connected dominating set for secure clustering in distributed sensor network
- 156 Downloads
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.
KeywordsDSN Security Weakly connected dominating set Maximal independent set Unit disk graph
Unable to display preview. Download preview PDF.
- 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
- 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