REVIEW 1 cited by
Energy-Efficient Naming in Beeping Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
A single-hop beeping network is a distributed communication model in which all stations can communicate with one another by transmitting only one-bit messages, called beeps. This paper focuses on resolving the distributed computing area's two fundamental problems: naming and counting problems. We are particularly interested in optimizing the energy complexity and the running time of algorithms to resolve these problems. Our contribution is to design randomized algorithms with an optimal running time of O(n log n) and an energy complexity of O(log n) for both the naming and counting problems on single-hop beeping networks of n stations.
Forward citations
Cited by 1 Pith paper
-
Computing in Anonymous Dynamic Networks with One-Bit Communications
One-bit broadcast-counting in anonymous dynamic networks supports general multiset computation in O(n³ log² n) rounds, nearly matching the congested O(n³) bound, with a matching Ω(n³) lower bound for large input universes.
Discussion (0). Continue with ORCID to comment.