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.

1. 서 론
2. 분산합의 알고리즘 탈중앙화 지표
    2.1 관리 계층의 탈중앙화 지표
    2.2 네트워크 계층의 탈중앙화 지표
3. PoN 분산합의 알고리즘 탈
    3.1 특징 및 합의 절차
    3.2 탈중앙화 성능 분석
    3.3 탈중앙화 제어 모델 설계
4. 수치 실험
    4.1 실험 설계
    4.2 수치 실험 및 결과 분석
5. 결 론
Acknowledgements
References

• Jin Young Choi(아주대학교 산업공학과) | 최진영 Corresponding author
• Young Chang Kim(한국전자통신연구원) | 김영창
• Jintae Oh(한국전자통신연구원) | 오진태
• Kiyoung Kim(한국전자통신연구원) | 김기영