A novel gls consensus algorithm for alliance chain in edge computing environment

7Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Wang, H., Yong, J., Liu, Q., & Yang, A. (2020). A novel gls consensus algorithm for alliance chain in edge computing environment. Computers, Materials and Continua, 65(1), 963–976. https://doi.org/10.32604/cmc.2020.09803

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free