A novel leader election mechanism for distributed systems using dynamic priority scores

Efficient coordination in distributed systems relies on selecting a suitable leader node, a process often challenged by asynchronous operations and node failures. Traditional leader election algorithms struggle with scalability and fault tolerance, necessitating more adaptive approaches to address these challenges. This paper introduces priority enhanced quorum consensus (PEQC), a novel leader election mechanism that integrates dynamically computed priority scores with quorum-based decision making. By utilising priority-based selection, PEQC ensures the election of the most suitable node while addressing node downtime and enhancing system responsiveness. A comparative analysis with existing algorithms demonstrates PEQC's superior performance in reducing election overhead, improving fault recovery, and ensuring fair leadership distribution.