election and electing publics authorities, statemen, parliament representative and local council,s members by people is un undeniable prerequisites of democracy. a state claiming democracy but lacking institutions as electoral systems and referendum could not be found. nevertheless electoral procedures are not identical everywhere. in some countries the nominee has to obtain the landslide (simp...

Regional General Elections or often referred to as regional elections are a method mechanism for electing heads that based on the constitution and legal according law. With election, it is hoped fair, honest wise leader can be elected form democratic government, but in process there disputes over results of vote count so has potential cause conflict if not resolved quickly. To overcome this, go...

Practical distributed systems are typically built under a crash-fault model. Recently, arbitrary faults such as bit flips have been observed surprisingly often [5], and have disrupted large services such as Amazon S3 [2]. We present a framework for building distributed protocols which automatically improves their fault coverage by means of an encoded processing compiler [4]. Although encoded pr...

This paper considers the problem of electing a leader ina dynamic ring in which processors are permitted to fail and recoverduring election. e( n log n + I;, ) messages, when counting only messagessent by functional processors, are shown to be necessary and sufficientfor dynamic ring election, where I;v is the number of processor recoveriesexperienced.

This paper presents two randomized protocols for the problem of electing a \leader" among a set of nodes in an arbitrary multi-hop radio network. First, a variation of the leader election protocol by Bar-Yehuda et al. BGI87] is presented, in which the termination problem is addressed. Then, an eecient randomized leader election protocol in arbitrary multi-hop radio networks is presented. Our el...

The concept of distributed communication bit complexity was introduced by Dinitz, Rajsbaum, and Moran. They studied bit complexity of Consensus and Leader Election, arriving at more or less exact bounds. This paper answers two questions on Leader Election, which remained there open. The first is to close the gap between the known upper and lower bounds, for electing a leader by two linked proce...

We present a new model that describes the process of electing a group of representatives (e.g., a parliament) for a group of voters. In this model, called the voting committee model, the elected group of representatives runs a number of ballots to make final decisions regarding various issues. The satisfaction of voters comes from the final decisions made by the elected committee. Our results s...

We present distributed protocols for electing a leader among k mobile agents that are dispersed among the n nodes of a graph. While previous solutions for the agent election problem were restricted to specific topologies or under specific conditions, the protocols presented in this paper face the problem in the most general case, i.e. for an arbitrary topology where the nodes of the graph may n...