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

DOI10.1016/j.jpdc.2011.07.002zbMath1231.68096OpenAlexW2075535233MaRDI QIDQ663430

Nannan Wang, Jiguo Yu, Guang-Hui Wang

Publication date: 14 February 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.07.002

zbMATH Keywords

simulationclusteringad hoc networksdominative capabilityextended dominating setextended weakly connected dominating set

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed systems (68M14)

Related Items (2)

Dominating problems in swapped networks ⋮ Self-stabilizing algorithm for two disjoint minimal dominating sets

Cites Work

• Unnamed Item
• Clustering wireless ad hoc networks with weakly connected dominating set
• Approximation algorithms for connected dominating sets
• Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
• MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
• Iterative Local Solutions for Connected Dominating Set in Ad Hoc Wireless Networks
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS

This page was built for publication: Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks