Open Access
ARTICLE
A Novel GLS Consensus Algorithm for Alliance Chain in Edge Computing Environment
Huijuan Wang1, *, Jiang Yong1, Qingwei Liu2, Alan Yang3
1 Information Security Department of the First Research Institute of the Ministry of Public Security of China, Beijing, 100084, China.
2 College of NBC Defense, Beijing, 100084, China.
3 Amphenol Assemble Tech, Houston, TX 77070, USA.
* Corresponding Author: Huijuan Wang. Email: .
Computers, Materials & Continua 2020, 65(1), 963-976. https://doi.org/10.32604/cmc.2020.09803
Received 19 January 2020; Accepted 30 April 2020; Issue published 23 July 2020
Abstract
Edge computing devices are widely deployed. An important issue that arises is
in that these devices suffer from security attacks. To deal with it, we turn to the
blockchain technologies. The note in the alliance chain need rules to limit write
permissions. Alliance chain can provide security management functions, using these
functions to meet the management between the members, certification, authorization,
monitoring and auditing. This article mainly analyzes some requirements realization
which applies to the alliance chain, and introduces a new consensus algorithm,
generalized Legendre sequence (GLS) consensus algorithm, for alliance chain. GLS
algorithms inherit the recognition and verification efficiency of binary sequence ciphers
in computer communication and can solve a large number of nodes verification of key
distribution issues. In the alliance chain, GLS consensus algorithm can complete node
address hiding, automatic task sorting, task automatic grouping, task node scope
confirmation, task address binding and stamp timestamp. Moreover, the GLS consensus
algorithm increases the difficulty of network malicious attack.
Keywords
Cite This Article
H. Wang, J. Yong, Q. Liu and A. Yang, "A novel gls consensus algorithm for alliance chain in edge computing environment,"
Computers, Materials & Continua, vol. 65, no.1, pp. 963–976, 2020.