Leader election in a network is one of the most important problems in the area of distributed algorithm design. Consider any network of N nodes; a leader node is defined to be any node of the network unambiguously identified by some characteristics (unique from all other nodes). A leader election process is defined to be a uniform algorithm (code) executed at each node of the network; at the end of the algorithm execution, exactly one node is elected the leader and all other nodes are in the non-leader state [GHS83, LMW86, Tel93, Tel95a, SBTS01] In this paper, our purpose is to propose an election algorithm for the oriented hyper butterfly networks with (Nlog N) messages. International Federation for Information Processing 2004.
CITATION STYLE
Shi, W., & Srimani, P. K. (2004). Leader election in hyper-butterfly graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3222, 292–299. https://doi.org/10.1007/978-3-540-30141-7_43
Mendeley helps you to discover research relevant for your work.