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

Mostefa Kara; Abdelkader Laouid; Muath Alshaikh; Mohammad Hammoudeh; Ahcene Bounceur; Reinhardt Euler; Abdelfattah Amamra; Brahim Laouid

doi:10.3390/app11156750

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

Mostefa Kara^*, Abdelkader Laouid, Muath Alshaikh, Mohammad Hammoudeh, Ahcene Bounceur^*, Reinhardt Euler, Abdelfattah Amamra, Brahim Laouid

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

30 Scopus citations

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 Round_i before participating in the next round Round_i+1 . Any node that resolves the game of Round_i 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.

Original language	English
Article number	6750
Journal	Applied Sciences (Switzerland)
Volume	11
Issue number	15
DOIs	https://doi.org/10.3390/app11156750
State	Published - 1 Aug 2021
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article.

Keywords

Blockchain
Distributed systems
Energy consumption
Game competition
Improved PoW consensus algorithms

ASJC Scopus subject areas

General Materials Science
Instrumentation
General Engineering
Process Chemistry and Technology
Computer Science Applications
Fluid Flow and Transfer Processes

Access to Document

10.3390/app11156750

Cite this

@article{b1772d2038f64b00be5bf24a1b3b8247,

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

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.",

keywords = "Blockchain, Distributed systems, Energy consumption, Game competition, Improved PoW consensus algorithms",

author = "Mostefa Kara and Abdelkader Laouid and Muath Alshaikh and Mohammad Hammoudeh and Ahcene Bounceur and Reinhardt Euler and Abdelfattah Amamra and Brahim Laouid",

note = "Publisher Copyright: {\textcopyright} 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article.",

year = "2021",

month = aug,

day = "1",

doi = "10.3390/app11156750",

language = "English",

volume = "11",

journal = "Applied Sciences (Switzerland)",

issn = "2076-3417",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "15",

}

TY - JOUR

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

AU - Kara, Mostefa

AU - Laouid, Abdelkader

AU - Alshaikh, Muath

AU - Hammoudeh, Mohammad

AU - Bounceur, Ahcene

AU - Euler, Reinhardt

AU - Amamra, Abdelfattah

AU - Laouid, Brahim

PY - 2021/8/1

Y1 - 2021/8/1

N2 - 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.

AB - 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.

KW - Blockchain

KW - Distributed systems

KW - Energy consumption

KW - Game competition

KW - Improved PoW consensus algorithms

UR - http://www.scopus.com/inward/record.url?scp=85111443075&partnerID=8YFLogxK

U2 - 10.3390/app11156750

DO - 10.3390/app11156750

M3 - Article

AN - SCOPUS:85111443075

SN - 2076-3417

VL - 11

JO - Applied Sciences (Switzerland)

JF - Applied Sciences (Switzerland)

IS - 15

M1 - 6750

ER -

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

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this