Related Experiment Video
Updated: Apr 7, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by
Lei Xu1,2, Peter Jeavons2
1Audaque Data Technology Ltd., Software Building, 9 Gaoxin Middle First Road, Nanshan District, Shenzhen 518000, China.
Abstract:
Leader election in anonymous rings and complete networks is a very practical problem in distributed computing. Previous algorithms for this problem are generally designed for a classical message passing model where complex messages are exchanged. However, the need to send and receive complex messages makes such algorithms less practical for some real applications. We present some simple synchronous algorithms for distributed leader election in anonymous rings and complete networks that are inspired by the development of the neural system of the fruit fly. Our leader election algorithms all assume that only one-bit messages are broadcast by nodes in the network and processors are only able to distinguish between silence and the arrival of one or more messages. These restrictions allow implementations to use a simpler message-passing architecture. Even with these harsh restrictions our algorithms are shown to achieve good time and message complexity both analytically and experimentally.
Related Concept Videos
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Distributed Loads: Problem Solving
Groupthink
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
Multimachine Stability
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
Incomplete Dominance