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

Authors:
Jiguo Yu;Nannan Wang;Guanghui Wang
Affiliations:
School of Computer Science, Qufu Normal University, Rizhao, Shandong, 276826, China and Key Laboratory for Intelligent Control Technique of Shandong Province, Rizhao, Shandong, 276826, China;School of Computer Science, Qufu Normal University, Rizhao, Shandong, 276826, China;School of Mathematics and System Science, Shandong University, Jinan, Shandong, 250100, China
Venue:
Journal of Parallel and Distributed Computing
Year:
2012

Citing 13
Cited 2

On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Topology control and routing in ad hoc networks: a survey

ACM SIGACT News
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Extended Dominating Set and Its Applications in Ad Hoc Networks Using Cooperative Communication

IEEE Transactions on Parallel and Distributed Systems
Clustering wireless ad hoc networks with weakly connected dominating set

Journal of Parallel and Distributed Computing
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks

IEEE Transactions on Computers
Maintaining weakly-connected dominating sets for clustering ad hoc networks

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

WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

IEEE Transactions on Information Theory
Cooperative communication in wireless networks

IEEE Communications Magazine

Review: Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey

Computer Communications
Dominating problems in swapped networks

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by cooperative communication in ad hoc networks, Wu et al. proposed extended dominating set (EDS) where each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors, and defined two types of dominating sets: extended strongly connected dominating set (ECDS) and extended weakly connected dominating set (EWCDS), according to the success of a broadcast process. An EWCDS is an effective method for clustering. In this paper, we extend the dominative capabilities of nodes such that each forward node dominates not only itself and its regular neighbors fully, but also its quasi-neighbors partly. Based on this extension, three novel algorithms to find EWCDSs in ad hoc networks are proposed. The correctness and performance of our algorithms are confirmed through theoretical analysis and comprehensive simulations.