Algorithms – ESA 2004

DOI10.1007/B100428zbMATH Open1111.68320OpenAlexW2483610301MaRDI QIDQ5464604FDOQ5464604

Authors: Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer 

Publication date: 18 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100428

Recommendations

• Deterministic digital clustering of wireless ad hoc networks
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Clustering wireless ad hoc networks with weakly connected dominating set
• An efficient distributed algorithm for constructing small dominating sets
• Automatic decentralized clustering for wireless sensor networks

Mathematics Subject Classification ID

Randomized algorithms (68W20) Network design and communication in computer systems (68M10)

Cited In (5)

• Competitive throughput in multi-hop wireless networks despite adaptive jamming
• Coloring unstructured radio networks
• Sade: competitive MAC under adversarial SINR
• Estimation of the Number of Clusters in Multipath Radio Channel Data Sets
• Equilibria of Games in Networks for Local Tasks

This page was built for publication: Algorithms – ESA 2004

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