Proof of Optimum (PoO): Consensus Model Based on Fairness and Efficiency in Blockchain

dc.authoridKose, Utku/0000-0002-9652-6415en_US
dc.authoridBirogul, Serdar/0000-0003-4966-5970en_US
dc.authorscopusid57216412008en_US
dc.authorscopusid36503422100en_US
dc.authorscopusid36544118500en_US
dc.authorwosidKose, Utku/C-8683-2009en_US
dc.authorwosidBirogul, Serdar/AAF-7487-2019en_US
dc.contributor.authorGunduz, Fatih
dc.contributor.authorBirogul, Serdar
dc.contributor.authorKose, Utku
dc.date.accessioned2024-08-23T16:03:37Z
dc.date.available2024-08-23T16:03:37Z
dc.date.issued2023en_US
dc.departmentDüzce Üniversitesien_US
dc.description.abstractBlockchain systems are popular technologies that have recently emerged. As a decentralized system, blockchain technology has provided many solutions and many problems associated with these solutions. One of its most important problems is that while performing hash calculations very intensively to create a new consensus block, it reduces its efficiency depending on the duration. In this study, a new model to avoid Proof of Work (PoW), which directs the computations made to create blocks to optimization algorithms, is proposed. The proof mechanism proposed in this study is called Proof of Optimization (PoO). A traveling salesman problem (TSP) is entered into the designed system to solve the optimization algorithms. Nodes are asked to solve the TSP in certain iterations and populations. As a result, nodes are asked to create blocks with the fitness, density and time values obtained. PoO and PoW consensus algorithms were subjected to an experimental comparison in the system. The test results show that the block generation time of the PoO consensus model varies between 2 s according to the dataset solution with the least cities (ulysses22) and 60 s according to the dataset solution with the most cities (gr666). Additionally, as a result of experimental analyses, it was determined that decentralization, which is the percentage of block creation among miners in the blockchain, reached a more stable value and the fairness index rose above 0.90 on average. When the obtained values were compared with PoW, it was observed that the block time was more stable and the decentralization of the blockchain was higher. In this way, high-equipped nodes in the blockchain system are prevented from dominating the network. Thus, it is ensured that low-equipped nodes have the right to create blocks in the blockchain. The difficulty levels of the problems can be adjusted by changing the number of cities in the TSP evaluated in this study. In this way, the problem of creating blocks in the network can be made more difficult or easier at any time.en_US
dc.identifier.doi10.3390/app131810149
dc.identifier.issn2076-3417
dc.identifier.issue18en_US
dc.identifier.scopus2-s2.0-85172870401en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.urihttps://doi.org/10.3390/app131810149
dc.identifier.urihttps://hdl.handle.net/20.500.12684/13830
dc.identifier.volume13en_US
dc.identifier.wosWOS:001078850900001en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherMdpien_US
dc.relation.ispartofApplied Sciences-Baselen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectblockchainen_US
dc.subjectoptimizationen_US
dc.subjectgenetic algorithmen_US
dc.subjecttraveling salesman problemen_US
dc.subjectconsensus algorithmen_US
dc.titleProof of Optimum (PoO): Consensus Model Based on Fairness and Efficiency in Blockchainen_US
dc.typeArticleen_US

Dosyalar