A novel algorithm for secure and reliable coordinator election in distributed networks
Shital Subhashchandra Supase, Rajesh Baliram Ingle · International Journal of Advanced Technology and Engineering Exploration · 2021
Electing a reliable coordinator is a crucial task in peer-to-peer distributed network.The peer-to-peer distributed network comprises a number of peer entities.These member entities elect the coordinator entity by consensus [1-3].Different consensus algorithms exist for electing an entity as a coordinator and those are generally termed as coordinator election algorithms.The majority of the existing election algorithms focus on improving the performance measures in particular communication cost [4][5][6].As the entities in the system are networked and use message passing technique for communication and execution of distributed election algorithm, electing a reliable entity as a coordinator is a challenge.The unreliable communication channel used in message passing makes the election algorithm vulnerable to security attacks [7, 8] The unauthorized access may result in a security and privacy attack which includes the impersonation and denial of voting attack [9,10].