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.

翻译：单声波蜂鸣网络是一种分布式通信模式,所有台站都可以通过只发送一位电文(称为蜂鸣)相互交流。本文侧重于解决分布式计算区域的两个基本问题:命名和计数问题。我们特别感兴趣的是优化能源复杂性和算法运行时间以解决这些问题。我们的贡献是设计随机算法,其最佳运行时间为O(nlog n),而O(log n)的能量复杂性为n站点单声波网络的命名和计数问题。