FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS

DOI10.1142/S0129054103001698MaRDI QIDQ5696904zbMATH OpenOpenAlexFDO

Authors Alfredo Ferro, G. Pigola, Alfredo Pulvirenti, Dafna Shasha

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054103001698

zbMATH Keywords

wireless networkantipole clusteringclosest matchmobile base stations

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Discrete mobile centers
• Discrete mobile centers
• A weight-based clustering algorithm for mobile ad hoc network
• Landmark routing in ad hoc networks with mobile backbones.
• A Merging Clustering Algorithm for Mobile Ad Hoc Networks

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A matching problem in the plane
• Geometry helps in bottleneck matching and related problems
• Optimal Point Location in a Monotone Subdivision

Cited in

(1)

• scientific article; zbMATH DE number 2080816 (Why is no real title available?)

This page was built for publication: FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS

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