Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs

Authors:
Kai Xing;Wei Cheng;E. K. Park;Shmuel Rotenstreich
Affiliations:
-;-;-;-
Venue:
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Year:
2008

Citing 0
Cited 3

Minimum CDS in multihop wireless networks with disparate communication ranges

WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
A family of simple distributed minimum connected dominating set-based topology construction algorithms

Journal of Network and Computer Applications
DisC diversity: result diversification based on dissimilarity and coverage

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of minimum connected dominating set in geometric $k$-disk graphs. This research is motivated by the problem of virtual backbone construction in wireless ad hoc and sensor networks, where the coverage area of nodes are disks with different radii. We derive the size relationship of any maximal independent set and the minimum connected dominating set in geometric $k$-disk graphs, and apply it to analyze the performances of two distributed connected dominating set algorithms we propose in this paper. These algorithms have a bounded performance ratio and low communication overhead, and therefore have the potential to be applied in real ad hoc and sensor networks.