A New Election Algorithm for DPos Consensus Mechanism in Blockchain

被引：43

作者：

Luo, Yinghui ^{[1
]}

Chen, Yiqun ^{[1
]}

Chen, Qiang ^{[1
]}

Liang, Qinglin ^{[2
]}

机构：

[1] Guangdong Univ Educ, Dept Comp Sci, Guangzhou, Guangdong, Peoples R China

[2] Guangzhou South China Business Trade Coll, Training Ctr, Guangzhou, Guangdong, Peoples R China

来源：

2018 7TH INTERNATIONAL CONFERENCE ON DIGITAL HOME (ICDH 2018) | 2018年

关键词：

Block chain; Decentralization; Consensus mechanism; PoW; DPoS;

D O I：

10.1109/ICDH.2018.00029

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The block chain has achieved great success in bit coin, and its decentralization idea caught highly attention of financial institutions, capital markets and academia. Decentralization is the most fundamental feature of the block chain, but decentralization sacrifices efficiency, while mining leads to high bit coin transaction costs; in some industries, such as the commercial retail, high efficiency and low cost are required. The consensus algorithm is the core technology to achieve non-centralization. This article proposes a DPoS consensus mechanism election algorithm. This algorithm improves the ring-based coordinator election algorithm. First, the algorithm is used to elect the agents, and then the final winner, reach a new consensus, meet the requirements of the block chain performance in the commercial retail sector, reduce transaction costs, and construct a fair, freely competitive, non-monopoly, secure and non-centralized block chain platform.

引用

页码：116 / 120

页数：5

共 10 条

[1] IMPROVED ALGORITHM FOR DECENTRALIZED EXTREMA-FINDING IN CIRCULAR CONFIGURATIONS OF PROCESSES [J].

CHANG, E ;

ROBERTS, R .

COMMUNICATIONS OF THE ACM, 1979, 22 (05) :281-283

[2]

Dorri Ali, 2017, 2017 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops), P618, DOI 10.1109/PERCOMW.2017.7917634

[3] The Bitcoin Backbone Protocol: Analysis and Applications [J].

Garay, Juan ;

Kiayias, Aggelos ;

Leonardos, Nikos .

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2015, PT II, 2015, 9057 :281-310

[4] THE BYZANTINE GENERALS PROBLEM [J].

LAMPORT, L ;

SHOSTAK, R ;

PEASE, M .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03) :382-401

[5]

Lamport L, 2011, LECT NOTES COMPUT SC, V6950, P211, DOI 10.1007/978-3-642-24100-0_22

[6] Inclusive Block Chain Protocols [J].

Lewenberg, Yoad ;

Sompolinsky, Yonatan ;

Zohar, Aviv .

FINANCIAL CRYPTOGRAPHY AND DATA SECURITY (FC 2015), 2015, 8975 :528-547

[7] Revision of the poorly known Neotropical butterfly genus Zischkaia Forster, 1964 (Lepidoptera, Nymphalidae, Satyrinae), with descriptions of nine new species [J].

Nakahara, Shinichi ;

Zacca, Thamara ;

Dias, Fernando M. S. ;

Dolibaina, Diego R. ;

Xiao, Lei ;

Espeland, Marianne ;

Casagrande, Mirna M. ;

Mielke, Olaf H. H. ;

Lamas, Gerardo ;

Hijertas, Blanca ;

Kleckner, Kaylin ;

Willmott, Keith R. .

EUROPEAN JOURNAL OF TAXONOMY, 2019, 551 :1-67

[8] FruitChains: A Fair Blockchain [J].

Pass, Rafael ;

Shi, Elaine .

PROCEEDINGS OF THE ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'17), 2017, :315-324

[9] Optimal Selfish Mining Strategies in Bitcoin [J].

Sapirshtein, Ayelet ;

Sompolinsky, Yonatan ;

Zohar, Aviv .

FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2016, 2017, 9603 :515-532

[10] Secure High-Rate Transaction Processing in Bitcoin [J].

Sompolinsky, Yonatan ;

Zohar, Aviv .

FINANCIAL CRYPTOGRAPHY AND DATA SECURITY (FC 2015), 2015, 8975 :507-527

← 1 →