蜂鸣网络中的节能命名
Energy-Efficient Naming in Beeping Networks
AI总结:
针对单跳蜂鸣网络中的命名与计数问题,本文提出随机算法,在 n 个站点上实现 O(n log n) 最优运行时间和 O(log n) 能量复杂度。
摘要:
单跳蜂鸣网络是一种分布式通信模型,其中所有站点都可以通过仅传输称为蜂鸣的一比特消息来相互通信。本文聚焦于解决分布式计算领域的两个基本问题:命名问题和计数问题。我们尤其关注优化解决这些问题的算法的能量复杂度和运行时间。我们的贡献是,在包含 n 个站点的单跳蜂鸣网络上,针对命名和计数问题设计了随机算法,其最优运行时间为 O(n log n),能量复杂度为 O(log n)。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。