A Novel Method for Leader Election Algorithm

Mirakhorli, Mehdi; Sharifloo, Amir Azim; Abbaspour, Maghsoud

doi:10.1109/cit.2007.86

Cited by 6 publications

(6 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such that the set N= {1, 2, 3, …, n-1, n} where N [1] is the node with ID=1 and N [2] is the node with ID=2, and so on. This ID could either represent the node's network address (this is applicable in cases where all nodes are exactly the same with no distinguishing characteristics), or the ID could represent the capacity of nodes (this is applicable in unreliable environments such ad hoc networks, where nodes are varying in their capacities, and the node with higher capacity will be assigned a higher ID).…”

Section: Algorithm Assumptionsmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient Overhead-aware Leader Election Algorithm for Distributed Systems

Yassein¹,

Alslaity²,

Alwidian³

2012

IJCA

View full text Add to dashboard Cite

In the area of distributed computing, the leader election process is meant with selecting a single node as a leader or a coordinator for a particular task that is distributed among other members. In such environments, if the leader got crashed, all other nodes have to elect another leader. In the literature, many leader election algorithms have been proposed. Most popular is the Garcia Molina's Bully algorithm. In this paper, we propose a new leader election algorithm that is based on sending a lower number of messages to perform leader election. The results show that our proposed algorithm reduces the overhead associated with the classical Garcia's Bully algorithm and efficiently outperform it in terms of reducing latency and message complexity.

show abstract

Section: Algorithm Assumptionsmentioning

confidence: 99%

“…Examples of these nodes are file servers, time servers and central lock coordinators. These servers are called leaders [2]. Algorithms through which leaders are elected called: leader election algorithms.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Overhead-aware Leader Election Algorithm for Distributed Systems

Yassein¹,

Alslaity²,

Alwidian³

2012

IJCA

View full text Add to dashboard Cite

show abstract

“…Therefore, (10) calculates Election process Consuming Time ( 1 ). However, (7) and (10) will be changed to (11) and (14) respectively when all coordinator alternatives are already crashed but coordinator itself is still up.…”

Section: Fceabr Time Complexity Analyzingmentioning

confidence: 99%

“…The first one is based on Bully algorithm and passes fewer messages than [10] which will be proved by simulation. Mirakhorli [11] proposed an algorithm by considering k candidate for coordinating in order to prevent new global election. When a typical process such as N finds a coordinator crashed, it'll send Crash-Leader message to candide1.…”

Section: Related Workmentioning

confidence: 99%

A Distributed Fault Tolerance Global Coordinator Election Algorithm in Unreliable High Traffic Distributed Systems

Rahdari

Rahmani²,

Aboutaleby³

et al. 2015

IJITCS

View full text Add to dashboard Cite

-Distributed systems consist of several management sites which have different resource sharing levels. Resources can be shared among inner site and outer site processes at first and second level respectively. Global coordinator should exist in order to coordinate access to multi site's shared resources. Moreover; some other coordinators should manage access to inner site's shared resources so that exerting appropriate coordinator election algorithms in each level is crucial to achieve most efficient system. In this paper a hierarchical distributed election algorithm is proposed which eliminates single point of failure of election launcher. Meanwhile traffic is applied to network at different times and the number of election messages is extremely decreased as well which applies more efficiency especially in high traffic networks. A standby system between coordinators and their first alternative is considered to induct less wait time to processes which want to communicate with coordinator .

show abstract

“…This particular process is referred to as the leader. In distributed systems, a leader is responsible to act as an initiator and a coordinator and to handle a specific job such as directory server, token regenerator and central lock coordinator [3] The process of selecting and assigning a unique leader in a distributed system is known as leader election problem. In the literature, several leader election algorithms have been proposed for classical distributed systems [4], [5], [6], [7].…”

Section: Introductionmentioning

confidence: 99%

A Stable CoveringSet-based Leader Election Algorithm (SCLEA) for Mobile Ad hoc Distributed Systems

Alwidian¹,

Alslaity²

2012

IJCA

View full text Add to dashboard Cite

Leader election process is known as the task of selecting a particular node or a process to be a unique leader of the distributed system. Many algorithms were proposed for leader election in classical, wired distributed systems. However, with the advent of wireless communication technology, the domain of distributed computing becomes much wide, and the concept of leader election in such environments has been changed due to the dynamic topology resulted from nodes' mobility. The existing classical leader election algorithms do not adapt well in mobile ad hoc environments. In this paper, we propose a new leader election algorithm that is conscious about nodes' mobility and the dynamic topology of ad hoc networks. The main idea of our algorithm is to select a subset of the nodes to participate in the election process, the selected nodes should ensure coverage of other nodes and that are of low mobility. We show through mathematical analysis that our proposed algorithm, the "Stable CoveringSet-Based Leader Election Algorithm (SCLEA)" outperforms any other algorithm that depends on the simple flooding to perform leader election. The enhancement of our algorithm is advent in terms of reducing the message overhead associated with leader election process and minimizing the number of redundant ELECTION messages as much as possible.

show abstract

A Novel Method for Leader Election Algorithm

Cited by 6 publications

References 4 publications

An Efficient Overhead-aware Leader Election Algorithm for Distributed Systems

An Efficient Overhead-aware Leader Election Algorithm for Distributed Systems

A Distributed Fault Tolerance Global Coordinator Election Algorithm in Unreliable High Traffic Distributed Systems

A Stable CoveringSet-based Leader Election Algorithm (SCLEA) for Mobile Ad hoc Distributed Systems

Contact Info

Product

Resources

About