期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2019
卷号：97
期号：14
页码：3783-3795
出版社：Journal of Theoretical and Applied
摘要：Leader election is an important issue in distributed systems and communication networks. Many protocols and algorithms that are running on distributed systems need a leader to ensure smooth execution; the leader has the responsibility to synchronize and coordinate the system processes. The absence of the leader makes the system inconsistent, and therefore unreliable. Such problem, however, can be solved by leader election algorithms. In this paper, we propose �for the first time- a new leader election algorithm to solve the leader failure in honeycomb mesh network. The honeycomb mesh network desired due to its low network cost, regularity, and scalability. The proposed algorithm aims to select exactly one node among all active nodes in the network to be a new leader, the node, which is elected as the new leader, has more priority over other nodes. The performance of the proposed algorithm is evaluated by computing the number of messages and time steps required to elect a new leader and complete the algorithm mission. The mathematical evaluation shows that the proposed algorithm requires O(n) messages in O( ) time steps in the best case to complete, as well as O(n1.5) messages in O( ) time steps in the worst case.
