Approximating the Size of a Radio Network in Beeping Model

DOI10.1007/978-3-319-48314-6_23zbMath1437.68012OpenAlexW2546853090MaRDI QIDQ2835036

Marcin Kardas, Marek Klonowski, Dominik Pająk, Philipp Brandes, Roger Wattenhofer

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48314-6_23

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Approximation algorithms (68W25) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (2)

Ordered and delayed adversaries and how to work against them on a shared channel ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses

Uses Software

• HyperLogLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Order statistics and estimating cardinalities of massive data sets
• Probabilistic counting algorithms for data base applications
• Beeping a maximal independent set
• Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
• Deploying Wireless Networks with Beeps
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
• Algorithms and Computation
• Theory and Applications of Models of Computation

This page was built for publication: Approximating the Size of a Radio Network in Beeping Model