Leader Election Algorithms in Torus and Hypercube Networks Comparisons and Survey?

Leader failure is one of the most fundamental problems in distributed systems. This problem can be solved by Leader Election Algorithms (LEAs). These algorithms move the system from an initial state where all the nodes are in the same computation state into a new state where only one node is distinguished computationally (called leader) and all other nodes aware of this leader. This research aims to make survey for leader election algorithms in the most popular network topologies hypercube and torus networks. Comparisons will be made between algorithms in these networks using fixed number of nodes.