Clustering wireless ad hoc networks with weakly connected dominating set
From MaRDI portal
(Redirected from Publication:883274)
Recommendations
- Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
- Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks
- Deterministic digital clustering of wireless ad hoc networks
- The WNNP-based clustering algorithm for ad hoc networks
- Constructing weakly connected dominating set for secure clustering in distributed sensor network
Cited in
(12)- A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS
- Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- Clustering the wireless ad hoc networks: a distributed learning automata approach
- Algorithms – ESA 2004
- Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
- Improving Inter-cluster Broadcasting in Ad Hoc Networks by Delayed Flooding
- NP-completeness results for partitioning a graph into total dominating sets
- Self-stabilizing algorithm for two disjoint minimal dominating sets
- Constructing weakly connected dominating set for secure clustering in distributed sensor network
- scientific article; zbMATH DE number 6907966 (Why is no real title available?)
This page was built for publication: Clustering wireless ad hoc networks with weakly connected dominating set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883274)