A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS
From MaRDI portal
Recommendations
- Clustering wireless ad hoc networks with weakly connected dominating set
- scientific article; zbMATH DE number 1930757
- A Merging Clustering Algorithm for Mobile Ad Hoc Networks
- Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks
- Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks
Cites work
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Approximation algorithms for connected dominating sets
- Dominating sets for split and bipartite graphs
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- On weakly connected domination in graphs
Cited in
(6)- Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs
- Application of the conditional gradient method to resource allocation in wireless networks
- Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks
- Clustering the wireless ad hoc networks: a distributed learning automata approach
- The seeding and bi-criteria algorithms for fuzzy k-median problem
- Bounds relating the weakly connected domination number to the total domination number and the matching number
This page was built for publication: A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696911)
