Leader election is an extensively studied problem in Ad hoc networks. In our study, we have implemented an extended idea of an existing leader election algorithm for energy saving to arbitrary topological changes. In this method, our focus is to reduce the number of leader election processes; to make it more energy efficient. Unlike the previous solutions, the algorithm proposes that each node ...

In [3], Barrière et al. consider a qualitative model of distributed computing, where the labels of the entities are distinct but mutually incomparable. They study the leader election problem in a distributed mobile environment and they wonder whether there exists an algorithm such that for each distributed mobile environment, it either states that the problem cannot be solved in this environmen...

Many reliable distributed services rely on an eventual leader election to coordinate actions. The eventual leader detector has been proposed as a way to implement such an abstraction. It ensures that, eventually, each process in the system will be provided by an unique leader, elected among the set of correct processes in spite of crashes and uncertainties. A number of eventual leader election ...

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O( √ n log n) messages to elect a unique leader (with high probability). When considering the “explicit” variant of leader election where eventually every node knows th...

To date, leader-member exchange (LMX) research has primarily examined member outcomes, such as member attitudes and performance. However, little research exists regarding outcomes specific to the leader. Focusing on the leader-member dyad, we develop a framework of leader outcomes resulting from resource exchanges with members. We propose specific resource substitutes and discuss the impact of ...

We study the problem of real-time leader election in a shared memory environment. This problem requires a single processor to be distinguished as the leader and requires an upper bound on the duration for which no leader is present. This processor can be used to provide services which must be continuously available. Coan and Thomas proposed a protocol for this problem which requires O(log N) ti...

We consider the problem of electing a leader on a ring of nameless processors by de terministic and self stabilizing protocols A processor can read the state of its neighbors and its own state to determine if it is enabled A central demon scheduler picks an enabled processor to make an atomic move In an atomic move the processor changes to a new state which is a function of its old state and th...