• International journal of advanced smart convergence
• /
• 제10권3호
• /
• pp.207-213
• /
• 2021

Informatization and digital transformation across industries are big trends in the world. However, although a few food groups are investing in informatization on a pilot basis, informatization is still delayed in related industries, such as distribution, logistics, etc. Therefore, consumers often are not able to have easy access to detailed information about products. In this paper, to improve these problems, we propose a fresh food logistics solution that adopts Proof of Nonce (PoN) consensus algorithm with Internet of Thing (IoT) technology. The recently developed PoN algorithm dramatically reduces a time for generating a block and is suitable for a platform that collects and services real-time information. We expect to improve their trust in the platform by preventing forgery/falsification of information recorded in real time through this paper.

• 품질경영학회지
• /
• 제49권4호
• /
• pp.527-537
• /
• 2021

Purpose: The purpose of this study was to suggest an improved version of Proof-of-Nonce (PoN) algorithm, which is a distributed consensus algorithm used for block chain system. Methods: First, we used response surface method for design of experiment that is to generate experimental points considering non-linear relationship among variables. Then, we employed overlapped contour plots for visualizing the impact of control variables to performance target. Results: First, we modified the consensus procedure of the existing PoN algorithm by diminishing the content of the exchanged message. Then, we verified the performance improvement of the new PoN algorithm by performing a numerical experiment and paired t-test. Finally, we established new regression models for consensus time and Transactions per second (TPS) and proposed a method for optimizing control variables for obtaining performance target. Conclusion: We could improve the performance of the previous version of PoN algorithm by modifying the content of the exchanged message during 4-steps of consensus procedure, which might be a stepping stone for designing an efficient and effective consensus algorithm for blockchain system with dynamic operation environment.

• ETRI Journal
• /
• 제42권6호
• /
• pp.872-885
• /
• 2020

Distributed consensus requires the consent of more than half of the congress to produce irreversible results, and the performance of the consensus algorithm deteriorates with the increase in the number of nodes. This problem can be addressed by delegating the agreement to a few selected nodes. Since the selected nodes must comply with the Byzantine node ratio criteria required by the algorithm, the result selected by any decentralized node cannot be trusted. However, some trusted nodes monopolize the consensus node selection process, thereby breaking decentralization and causing a trilemma. Therefore, a consensus node selection algorithm is required that can construct a congress that can withstand Byzantine faults with the decentralized method. In this paper, an algorithm based on the Byzantine agreement among decentralized agents to facilitate agreement between decentralization nodes is proposed. It selects a group of random consensus nodes per block by applying the proposed proof of nonce algorithm. By controlling the percentage of Byzantine included in the selected nodes, it solves the trilemma when an arbitrary node selects the consensus nodes.

• 산업경영시스템학회지
• /
• 제45권1호
• /
• pp.1-9
• /
• 2022

The PoN (Proof of Nonce) distributed consensus algorithm basically uses a non-competitive consensus method that can guarantee an equal opportunity for all nodes to participate in the block generation process, and this method was expected to resolve the first trilemma of the blockchain, called the decentralization problem. However, the decentralization performance of the PoN distributed consensus algorithm can be greatly affected by the network transaction transmission delay characteristics of the nodes composing the block chain system. In particular, in the consensus process, differences in network node performance may significantly affect the composition of the congress and committee on a first-come, first-served basis. Therefore, in this paper, we presented a problem by analyzing the decentralization performance of the PoN distributed consensus algorithm, and suggested a fairness control algorithm using a learning-based probabilistic acceptance rule to improve it. In addition, we verified the superiority of the proposed algorithm by conducting a numerical experiment, while considering the block chain systems composed of various heterogeneous characteristic systems with different network transmission delay.

• 산업경영시스템학회지
• /
• 제43권4호
• /
• pp.168-177
• /
• 2020

In recent years, importance of blockchain systems has been grown after success of bitcoin. Distributed consensus algorithm is used to achieve an agreement, which means the same information is recorded in all nodes participating in blockchain network. Various algorithms were suggested to resolve blockchain trilemma, which refers conflict between decentralization, scalability, security. An algorithm based on Byzantine Agreement among Decentralized Agents (BADA) were designed for the same manner, and it used limited committee that enables an efficient consensus among considerable number of nodes. In addition, election of committee based on Proof-of-Nonce guarantees decentralization and security. In spite of such prominence, application of BADA in actual blockchain system requires further researches about performance and essential features affecting on the performance. However, performance assessment committed in real systems takes a long time and costs a great deal of budget. Based on this motivation, we designed and implemented a simulator for measuring performance of BADA. Specifically, we defined a simulation framework including three components named simulator Command Line Interface, transaction generator, BADA nodes. Furthermore, we carried out response surface analysis for revealing latent relationship between performance measure and design parameters. By using obtained response surface models, we could find an optimal configuration of design parameters for achieving a given desirable performance level.