Approximate Neighbor Counting in Radio Networks

DOI10.4230/LIPIcs.OPODIS.2018.26OpenAlexW2963877448MaRDI QIDQ5091104

Calvin Newport, Chaodong Zheng

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1811.03278

zbMATH Keywords

approximate countingradio networksneighborhood size estimation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cites Work

• Unnamed Item
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Probabilistic algorithms for the wake-up problem in single-hop radio networks
• Leader election using loneliness detection
• Fast size approximation of a radio network in beeping model
• 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
• Communication Primitives in Cognitive Radio Networks
• Probability and Computing
• Radio Network Lower Bounds Made Easy
• Algorithms and Computation
• Theory and Applications of Models of Computation

This page was built for publication: Approximate Neighbor Counting in Radio Networks