Leader election algorithm in hypercube netwok when the id number is not distinguished

One of the most critical problems in distributed systems is Leader Failure. Distributed network becomes unstable without leadership. To solve this problem Leader Election algorithm is executed to give the leadership to other processor. The election process starts when one or more processor discovers that leader has failed, and it terminates when the remaining processors know who the new leader is. Election process use ID number to choose the new leader. In this study we propose distributed leader election algorithm to solve leader failure in hypercube network when ID number is not distinguished. Performance is evaluated and analyzed. In a network of N nodes connected by a Hypercube network the proposed algorithm uses O(N ) messages to elect a new leader in O(log N) time steps.