A compute and wait in pow (Cw-pow) consensus algorithm for preserving energy consumption

Kara, Mostefa, Laouid, Abdelkader, Alshaikh, Muath, Hammoudeh, Mohammad ORCID: https://orcid.org/0000-0002-9735-2365, Bounceur, Ahcene, Euler, Reinhardt, Amamra, Abdelfattah and Laouid, Brahim (2021) A compute and wait in pow (Cw-pow) consensus algorithm for preserving energy consumption. Applied Sciences, 11 (15). 6750. ISSN 2076-3417

Preview

Published Version Available under License Creative Commons Attribution. Download (1MB) | Preview

Abstract

Several trusted tasks use consensus algorithms to solve agreement challenges. Usually, consensus agreements are used to ensure data integrity and reliability in untrusted environments. In many distributed networking fields, the Proof of Work (PoW) consensus algorithm is commonly used. However, the standard PoW mechanism has two main limitations, where the first is the high power consumption and the second is the 51 % attack vulnerability. In this paper, we look to improve the PoW consensus protocol by introducing several proof rounds. Any given consensus node should resolve the game of the current round Roundi before participating in the next round Roundi+1 . Any node that resolves the game of Roundi can only pass to the next round if a predetermined number of solutions has been found by other nodes. The obtained evaluation results of this technique show significant improvements in terms of energy consumption and robustness against the 51 % and Sybil attacks. By fixing the number of processes, we obtained an energy gain rate of 15.63 % with five rounds and a gain rate of 19.91 % with ten rounds.