An improved election algorithm in chordal ring networks

Abstract

Distributed election arises in all situations where a single processor is needed to control a certain function. In this paper, we address this problem in networks with a “sense of direction”which is the capability to distinguish between its adjacent communication links. We present an efficient election algorithm which works on all chordal ring networks. We show that the algorithm has an O(n) message complexity both on a regular chordal ring with only O(n log log n) links and on an irregular chordal ring with only O(n) links. This is an improvement over the algorithms presented in [1,9] where O(n 2) and O(n log n) links are needed respectively to achieve O(n) message complexity in distributed election with a sense of direction. Since at least O(n) messages and 0(n) links are needed to perform an election in a network with n processors, our algorithm is optimal when irregular chordal ring networks are considered.