• Electronics and Telecommunications Trends
• /
• v.37 no.1
• /
• pp.63-72
• /
• 2022

Recently, blockchain has been attracting attention as a high-reliability technology in various fields. However, the Proof-of-Work-based distributed consensus algorithm applied to representative blockchains, such as Bitcoin and Ethereum, has limitations in applications to various industries owing to its excessive resource consumption and performance limitations. To overcome these limitations, various distributed consensus algorithms have appeared, and recently, hybrid distributed consensus algorithms that use two or more consensus algorithms to achieve decentralization and scalability have emerged. This paper introduces the technological trends of the latest high-performance distributed consensus algorithms by analyzing representative hybrid distributed consensus algorithms.

• Journal of the Korea Convergence Society
• /
• v.10 no.11
• /
• pp.41-46
• /
• 2019

Recently, the Byzantine Fault Tolerance(BFT) family of consensus algorithms has been attracting attention as the problems of the Proof-of-work (PoW) blockchain consensus algorithms result in energy waste and lack of scalability. One of the great features of the PBFT family consensus algorithms is the formation of a set of validators and consensus within them. In this paper, we compared and analyzed the scalability, targeted attackability, and civil attackability of Algorand, Stellar, and EOS validator set formation methods among BFT family consensus algorithms. Also, we found the problems of each verifier formation method through data analysis, and the consensus algorithms showed that the centralization phenomenon that the few powerful nodes dominate the whole system in common.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.4
• /
• pp.179-188
• /
• 2018

Recently, blockchain technology has been recognized as one of the most important issues for the 4th Industrial Revolution which can be represented by Artificial Intelligence and Internet of Things. Cryptocurrency, named Bitcoin, was the first successful implementation of blockchain, and it triggered the emergence of various cryptocurrencies. In addition, blockchain technology has been applied to various applications such as finance, healthcare, manufacturing, logistics as well as public services. Distributed consensus algorithm is an essential component in blockchain, and it enables all nodes belonging to blockchain network to make an agreement, which means all nodes have the same information. For example, Bitcoin uses a consensus algorithm called Proof-of-Work (PoW) that gives possession of block generation based on the computational volume committed by nodes. However, energy consumption for block generation in PoW has drastically increased due to the growth of computational performance to prove the possession of block. Although many other distributed consensus algorithms including Proof-of-Stake are suggested, they have their own advantages and limitations, and new research works should be proposed to overcome these limitations. For doing this, above all things, we need to establish an evaluation method existing distributed consensus algorithms. Based on this motivation, in this work, we suggest and analyze assessment items by classifying them as efficiency and safety perspectives for investigating existing distributed consensus algorithms. Furthermore, we suggest new assessment criteria and their implementation methods, which can be used for a baseline for improving performance of existing distributed consensus algorithms and designing new consensus algorithm in future.

• Journal of Information Processing Systems
• /
• v.14 no.1
• /
• pp.101-128
• /
• 2018

Thanks to its potential in many applications, Blockchain has recently been nominated as one of the technologies exciting intense attention. Blockchain has solved the problem of changing the original low-trust centralized ledger held by a single third-party, to a high-trust decentralized form held by different entities, or in other words, verifying nodes. The key contribution of the work of Blockchain is the consensus algorithm, which decides how agreement is made to append a new block between all nodes in the verifying network. Blockchain algorithms can be categorized into two main groups. The first group is proof-based consensus, which requires the nodes joining the verifying network to show that they are more qualified than the others to do the appending work. The second group is voting-based consensus, which requires nodes in the network to exchange their results of verifying a new block or transaction, before making the final decision. In this paper, we present a review of the Blockchain consensus algorithms that have been researched and that are being applied in some well-known applications at this time.

• Electronics and Telecommunications Trends
• /
• v.33 no.1
• /
• pp.45-56
• /
• 2018

A Blockchain is a type of distributed ledger system that consists of a large number of nodes. A block is a container in which transactions are included, and the transactions can be recorded in chronological order by chaining blocks. To work properly, it is essential that the nodes in the Blockchain system have the same image of the chained-blocks. Blockchain systems use various types of consensus algorithms to achieve the same states among the nodes, and the fundamental elements in these algorithms are proof of work and the main chain selection policy, particularly in permissionless Blockchain systems. However, consensus algorithms for permissioned Blockchain systems can be completely different from those of permissionless blockchain systems. In this paper, we overview the basic working mechanism of consensus algorithms, and briefly introduce a few that are currently being applied.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.151-157
• /
• 2022

In this paper, the performance of various blockchain consensus algorithms was compared and analyzed as a method to increase the transaction cost and processing time during NFT transactions and to increase the transaction stability requirements that occur during smart contract execution. Network reliability and TPS are evaluation items for performance comparison. TPS and the stability of the Consensus algorithm are presented for three evaluation items. In order to establish a standardized expression for each evaluation item, the reliability of the node and the success rate of the smart contract were considered as variables in the calculation formula, and the performance of the consensus algorithm of the three groups, PoW/PoS, Paxos/Raft and PBFT, was compared under the same conditions. / analyzed. As a result of the performance evaluation, the network reliability of the three groups was similar, and in the case of the remaining two evaluation items, it was analyzed that the PBFT consensus algorithm was superior to other consensus algorithms. Through the performance evaluation equations and results of this study, it was analyzed that when the PBFT consensus processing process is reflected in the consensus process, the network reliability can be guaranteed and the stability and economic efficiency of the consensus algorithm can be increased.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.289-294
• /
• 2015

The consensus problem is finding a representative string, called a consensus, of a given set S of k strings. Circular strings are different from linear strings in that the last symbol precedes the first symbol. Given a set S of circular strings of length n over an alphabet ${\Sigma}$, we first present an $O({\mid}{\Sigma}{\mid}nlogn)$ time parallel algorithm for finding a consensus of S minimizing both radius and distance sum when k=3 using O(n) threads. Then we present an $O({\mid}{\Sigma}{\mid}n^2logn)$ time parallel algorithm for finding a consensus of S minimizing distance sum when k=4 using O(n) threads. Finally, we compare execution times of our algorithms implemented using CUDA with corresponding sequential algorithms.

• Convergence Security Journal
• /
• v.20 no.1
• /
• pp.3-8
• /
• 2020

Blockchain can enhance data transparency and security through decentralized data management that is out of the centralized system. permissioned blockchain of the blockchain platform, only trust-based authorized nodes can participate in the distributed network. Considering the characteristics of the permissioned blockchain, it is necessary to consider the network communication speed, transaction finality agreement, and stability as a condition for selecting the consensus algorithm. The consensus algorithms of the permissioned blockchain environment are diverse such as PoA, PBFT, Raft, etc., but there are no various evaluation factors for selecting consensus algorithms. In this paper, various performance evaluation factors are proposed to analyze the characteristics of each consensus algorithm of the permissioned blockchain and to select an efficient consensus algorithm considering the characteristics of the user environment that composes the network. The proposed performance evaluation factor can consider the network speed, stability, and consensus of the finality agreement between nodes under the premise of trust. Through this, a more efficient blockchain network environment can be constructed.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.4
• /
• pp.243-248
• /
• 2013

In wireless sensor networks, consensus algorithms for dynamic systems may flexibly usable for their data fusion of a sensor network. In this paper, a distributed data fusion filter is implemented using an average consensus based on distributed sensor data, which is composed of some sensor nodes and a sink node to track the mean values of n sensors' data. The consensus filter resolve the problem of data fusion by a distribution Kalman filtering scheme. We showed that the consensus filter has an optimal convergence to decrease of noise propagation and fast tracking ability for input signals. In order to verify for the results of consensus filtering, we showed the output signals of sensor nodes and their filtering results, and then showed the result of the combined signal and the consensus filtering using zeegbee communication.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.617-621
• /
• 2012

This paper studies asymptotic consensus problem for linear multi-agent systems. We propose a distributed state feedback control algorithm for solving the problem under fixed and undirected network communication. In contrast with the conventional algorithms that use global information (e.g., graph connectivity), the proposed algorithm only uses local information from neighbors. The principle for achieving asymptotic consensus is that, for each agent, a distributed update law gradually increases the coupling gain of LQR-type feedback and thus, the overall stability of the multi-agent system is recovered by the gain margin of LQR.