Heuristic algorithms for constructing connected dominating sets with minimum size and bounded diameter in wireless networks

Authors:
Jiguo Yu;Nannan Wang;Guanghui Wang
Affiliations:
School of Computer Science, Qufu Normal University, Shandong, P. R. China;School of Computer Science, Qufu Normal University, Shandong, P. R. China;School of Mathematics, Shandong University, Shandong, P.R. China
Venue:
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Year:
2010

Citing 12
Cited 3

Unit disk graphs

Discrete Mathematics - Topics on domination
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Routing in Ad Hoc Networks Using a Spine

IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Generating Quality Dominating Sets for Sensor Network

ICCIMA '05 Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles

Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks

ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Algorithmic models for sensor networks

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks

Journal of Parallel and Distributed Computing
Review: Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey

Computer Communications
On dominating sets whose induced subgraphs have a bounded diameter

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Connected dominating set (CDS) is widely used in wireless networks as a virtual backbone for communication and routing between nodes. In order to measure the quality of a CDS, most researches in this area focus on reducing the size of a CDS, neglecting other important metrics, such as diameter between two communication parties. This paper considers the diameter as a quality factor for CDS construction, and develops two new heuristic algorithms. In particular, the CDS computed by the first algorithm has constant ratios 9 and 3 for its size and diameter, respectively. And that of the second algorithm has constant ratios 5 + ln 10 and 2. Both theoretical analysis and simulation show out the performance of the algorithms.