%0 Journal Article
%T Leader Election Algorithm in 3D Torus Networks with the Presence of One Link Failure
%A Mohammed Refai
%A Ibrahim AL-Oqily
%A Abed Alhamori
%J World of Computer Science and Information Technology Journal
%D 2012
%I 
%X Leader election is the process of choosing a leader for symmetry breaking where each node in the network eventually decides whether it is a leader or not. This paper proposes a new leader election algorithm to solve the problem of leader failure in three dimensional torus networks. The proposed algorithm solves the election problem despite the existent of link failure. In a network of N nodes connected by three dimensional torus network, the new algorithm needs O(N) messages to elect a new leader in time steps. These results are valid for two cases: the simple case where the leader failure is detected by one node, and the worst case where the failure is discovered by N-1 nodes.
%K Concurrency
%K Leader Election
%K Link Failure
%K leader failure
%K 3D Torus Networks.
%U http://www.wcsit.org/pub/2012/vol.2no.3/Leader%20Election%20Algorithm%20in%203D%20Torus%20Networks%20with%20the%20Presence%20of%20One%20Link%20Failure.pdf