A weight-based clustering algorithm for mobile ad hoc network
From MaRDI portal
Publication:3609147
zbMATH Open1174.68800MaRDI QIDQ3609147FDOQ3609147
Authors: Weidong Yang, Jieying Zhou, Guangzhao Zhang
Publication date: 6 March 2009
Recommendations
Cited In (15)
- A robust and energy-efficient weighted clustering algorithm on mobile ad hoc sensor networks
- A new algorithm for routing in ad-hoc network
- A self-stabilizing \(k\)-clustering algorithm for weighted graphs
- Performance analysis of a typical algorithm in an ad hoc network
- Title not available (Why is that?)
- Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks
- Performance analysis of mobility-based \(d\)-hop (MobDHop) clustering algorithm for mobile ad hoc networks
- The WNNP-based clustering algorithm for ad hoc networks
- FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS
- Advances in Neural Networks – ISNN 2005
- Graph theoretic clustering algorithms in mobile ad hoc networks and wireless sensor networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Merging Clustering Algorithm for Mobile Ad Hoc Networks
- Hierarchical Clustering Algorithm Based on Mobility in Mobile Ad Hoc Networks
This page was built for publication: A weight-based clustering algorithm for mobile ad hoc network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3609147)