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.

翻译：单跳信令网络是一种分布式通信模型，其中所有站点仅通过传输称为"信令"的单比特消息即可相互通信。本文聚焦于解决分布式计算领域的两个基本问题：命名问题和计数问题。我们特别致力于优化解决这些问题的算法能量复杂度和运行时间。我们的贡献在于针对n个站点的单跳信令网络，为命名问题和计数问题分别设计了运行时间最优为O(n log n)、能量复杂度为O(log n)的随机算法。