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.

翻译：单跳 Beeping 网络是一种分布式通信模型，其中所有站点均可以仅通过传输称为 Beeps 的一位消息相互通信。本文重点关注解决分布式计算领域的两个基本问题：命名和计数问题。我们特别着眼于优化解决这些问题的算法的能量复杂度和运行时间。我们的贡献是设计随机算法，可以在单跳 Beeping 网络的 n 个站点上解决命名和计数问题，其运行时间优化为 O(n log n)，能量复杂度为 O(log n)。