Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by Neural Development in Fruit Flies

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.

Differentiable Programming of Reaction-Diffusion Patterns

“…The task is to suppress A on all the chambers where their concentration was not the highest, and highlight A on the winner chamber. This task can also be seen as a variant of leader election in anonymous rings [Xu and Jeavons, 2015], where the leader needs to suppress all other nodes, with the added complexity that a leader must be chosen based on the input configuration of a specific group of chemicals. The capacity of performing leader election is an extremely important feature of most biological systems, as it enables differentiation of roles.…”

Modeling and Verifying Leader Election Algorithm in CSP (S)

“…There actually exist many research on leader election algorithm [1], [13]. Most of them use model checking based on a specific network such as ring [13] but seldom of them consider to verify LE.…”

“…There actually exist many research on leader election algorithm [1], [13]. Most of them use model checking based on a specific network such as ring [13] but seldom of them consider to verify LE. In this paper we formalize LE based on process algebra CSP and we concentrate on the status changing of a node, modeling the operations of each node.…”