Fault-tolerant Leader Election Research Articles

Fault Tolerant Leader Election in Distributed Systems

Fault Tolerant Leader Election in Distributed Systems

An integrated approach of designing functionality with security for distributed cyber-physical systems.

In this work, we propose a multi-tier architectural model to separate functionality and security concerns for distributed cyber-physical systems. On the line of distributed computing, such systems require the identification of leaders for distribution of work, aggregation of results, etc. Further, we propose a fault-tolerant leader election algorithm that can independently elect the functionality and security leaders. The proposed election algorithm identifies a list of potential leader capable nodes to reduce the leader election overhead. It keeps identifying the highest potential node as the leader, whenever needed, including the situation when one has failed. We also explain the proposed architecture and its management method through a case study. Further, we perform several experiments to evaluate the system performance. The experimental results show that the proposed architectural model improves the system performance in terms of latency, average response time, and the number of real-time tasks completed within the deadline.

Fault Tolerant Leader Election in Distributed Systems

Fault Tolerant Leader Election in Distributed Systems

Fault Tolerant Leader Election in Distributed Systems

There are many distributed systems which use a leader in their logic. When such systems need to be fault tolerant and the current leader suffers a technical problem, it is necesary to apply a special algorithm in order to choose a new leader. In this paper I present a new fault tolerant algorithm which elects a new leader based on a random roulette wheel selection.

A logical structure based fault tolerant approach to handle leader election in mobile ad hoc networks

We propose a light weight layered architecture to support the computation of leader in mobile ad hoc networks. In distributed applications, the leader has to perform a number of synchronization activities among participating nodes and numerous applications; hence, it is a stressed node and consequently prone to failure. Thus, fast and fault tolerant leader election is a major concern and popular area of research in distributed computing networks, in general, and wireless ad hoc networks, in particular. In the present article, we have proposed a fault tolerant leader election approach. More importantly, the nodes elect the leader quickly on the basis of local information only. The illustration includes suitable examples. The correctness proof and performance evaluation has also been presented.

Fault-tolerant aggregator election and data aggregation in wireless sensor networks

This paper presents three algorithms for aggregator election and data aggregation in wireless sensor networks where sensors can crash and recover. The network is divided in several regions. The algorithms ensure the election of a common data aggregator sensor within each region, in charge of the collection of local data and the election of a unique super-aggregator sensor, in charge of the collection of global data, among all the aggregators. Both elections are achieved by implementing the Omega failure detector, which provides a self-organising and fault-tolerant leader election service. Each algorithm is based on a different connectivity assumption. The first algorithm assumes that every pair of sensors in a region can communicate directly. The second algorithm only requires some correct sensor to communicate directly with the rest of sensors. Finally, the third algorithm only requires the existence of a multi-hop bidirectional path from some correct sensor to the rest of sensors. We also introduce a battery depletion threshold to enhance the quality of service of the wireless sensor network.

Election in asynchronous complete networks with intermittent link failures

Considers the problem of fault-tolerant leader election in asynchronous complete (fully-connected) distributed networks. The processors are reliable, but some of the communication channels may fail intermittently before or during the execution of the algorithm. Channel failures are undetectable due to the asynchronous nature of the network. Let n be the number of processors in the network and f be the maximum number of faulty channels incident on each processor, where f/spl les/ 1/2 [n-1]. Our algorithm uses at most O(n/sup 2/+nf/sup 2/) messages to elect a unique leader of the network. Each message consists of at most O(log|T|) bits, where |T| is the cardinality of the set of processor identifiers. All previous algorithms either tolerated only benign failures such as fail-stop failures, assumed that the network is synchronous, tolerated only a small number of failures, or assumed that the faults are detectable. Our algorithm is the first election algorithm that is designed specifically for asynchronous intermittently faulty complete networks in which up to 1/4 n[n-1] channels may be faulty, where each processor is adjacent to no more than 1/2 [n-1] faulty channels, and where the faults are undetectable. >