Clustering wireless ad hoc networks with weakly connected dominating set

DOI10.1016/J.JPDC.2007.03.001zbMath1118.68029OpenAlexW2053568252MaRDI QIDQ883274

Bo Han, Wei-Jia Jia

Publication date: 4 June 2007

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.2007.03.001

zbMATH Keywords

simulationclusteringdominating setdistributed algorithmwireless ad hoc networksweakly connected dominating set

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (6)

Self-stabilizing algorithm for two disjoint minimal dominating sets ⋮ Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks ⋮ Clustering the wireless ad hoc networks: a distributed learning automata approach ⋮ Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number ⋮ LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS ⋮ NP-completeness results for partitioning a graph into total dominating sets

This page was built for publication: Clustering wireless ad hoc networks with weakly connected dominating set