Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks

DOI10.1016/J.JCSS.2005.12.010MaRDI QIDQ2432743zbMATH OpenOpenAlexFDO

Authors Inn Inn Er, Winston Seah

Publication date 25 October 2006

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2005.12.010

zbMATH Keywords

clustering algorithmmessage complexitymobDHopmobile ad hoc networktime complexity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Performance analysis of mobility-based d-hop (MobDHop) clustering algorithm for mobile ad hoc networks
• A Merging Clustering Algorithm for Mobile Ad Hoc Networks
• Hierarchical Clustering Algorithm Based on Mobility in Mobile Ad Hoc Networks
• Clustering in mobile ad hoc networks through neighborhood stability-based mobility prediction
• A weight-based clustering algorithm for mobile ad hoc network

Cites work

• Performance analysis of mobility-based d-hop (MobDHop) clustering algorithm for mobile ad hoc networks

Cited in

(4)

• Analytical and simulative performance evaluation of cluster-based multihop ad hoc networks.
• Mobility-aware clustering algorithms with interference constraints in wireless mesh networks
• Performance analysis of mobility-based d-hop (MobDHop) clustering algorithm for mobile ad hoc networks
• scientific article; zbMATH DE number 2220136 (Why is no real title available?)

This page was built for publication: Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432743)