Distributed algorithms for election in unidirectional and complete networks
Consider a data communication network of n nodes, each of which has a unique identifier (id); otherwise the nodes are identical. The nodes are asleep and have no global information about network topology, number and ids of other nodes, etc. A distributed election algorithm is a means by which the nodes of the network distinguish one among them as the leader. The problem of distributively electing a leader in a network is viewed as a problem of synchronization among potential candidates for leadership. Each candidate tries to capture all the nodes. To guarantee that only one succeeds, all but one candidate are killed. Following this view, election algorithms in a general, two-component framework are designed. Component one is a capturing and termination detection mechanism, assuming only one candidate. Component two is a synchronization mechanism; to eliminate all but one candidate. In arbitrary networks the synchronization is complicated by the uncertainties of nodes about the network topology and the relative location of candidates.
- Research Organization:
- California Univ., Los Angeles (USA)
- OSTI ID:
- 5608910
- Country of Publication:
- United States
- Language:
- English
Similar Records
Reliable election in broadcast networks
Fault-tolerant distributed algorithm for election in complete networks