Choosing a leader on a hypercube

Abstract

The problem of electing a leader via message passing on a network is a fundamental problem in distributed processing. The authors present a simple algorithm for election of a leader on a hypercube with n nodes in O(n) messages.<>