Energy-Efficient Naming in Beeping Networks

TL;DR

This paper presents randomized algorithms for beeping networks that efficiently solve naming and counting problems with optimal time and energy complexity, advancing distributed communication methods.

Contribution

It introduces the first algorithms achieving optimal O(n log n) running time and O(log n) energy complexity for naming and counting in single-hop beeping networks.

Findings

Algorithms run in optimal O(n log n) time.

Energy complexity is reduced to O(log n).

Applicable to single-hop beeping networks of n stations.

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.