A secured and fault-tolerant algorithm for electing an efficient coordinator in distributed networks

Abstract

Selecting a reliable and stable coordinator is a crucial aspect of distributed systems, often vulnerable to node failures and security breaches. In response to these challenges, we present the Reliable and Stable Coordinator Election Algorithm in Distributed Systems (RSCEA). This algorithm is designed to withstand node failures and security threats during the election process. A key highlight of our approach is the utilization of a preference-based voting mechanism that incorporates essential nodal characteristics into the election procedure. By including nodal properties, the system's robustness is greatly increased, and a long-lasting and dependable coordinator is elected. The complexity of the RSCEA space, execution time and communication complexity were thoroughly examined. The findings show that RSCEA effectively selects a coordinator with linear message complexity proportional to the number of nodal features, denoted as O(n.m) where n is number of nodes and m indicates the number of attributes. RSCEA demonstrates scalability with a storage expense linear in number of nodes, thus markedly enhancing communication efficiency. RSCEA elects a reliable and stable coordinator in distributed networks. Its distinctive design, resilience, and effectiveness make it an important asset in the progression of distributed systems.

Keywords

• Distributed networks
• Fault-tolerance
• Preference-based voting method
• Security
• Scalability
• Liveness