Version 1
: Received: 14 August 2023 / Approved: 15 August 2023 / Online: 16 August 2023 (10:20:46 CEST)
How to cite:
Wu, F.; Gong, X.; Liu, J.; Li, Y.; Ni, M. LCAG ：A Lightweight Consensus Algorithm Based on Graph for the Internet of Things. Preprints2023, 2023081125. https://doi.org/10.20944/preprints202308.1125.v1
Wu, F.; Gong, X.; Liu, J.; Li, Y.; Ni, M. LCAG ：A Lightweight Consensus Algorithm Based on Graph for the Internet of Things. Preprints 2023, 2023081125. https://doi.org/10.20944/preprints202308.1125.v1
Wu, F.; Gong, X.; Liu, J.; Li, Y.; Ni, M. LCAG ：A Lightweight Consensus Algorithm Based on Graph for the Internet of Things. Preprints2023, 2023081125. https://doi.org/10.20944/preprints202308.1125.v1
APA Style
Wu, F., Gong, X., Liu, J., Li, Y., & Ni, M. (2023). LCAG ：A Lightweight Consensus Algorithm Based on Graph for the Internet of Things. Preprints. https://doi.org/10.20944/preprints202308.1125.v1
Chicago/Turabian Style
Wu, F., Yanbin Li and Mingtao Ni. 2023 "LCAG ：A Lightweight Consensus Algorithm Based on Graph for the Internet of Things" Preprints. https://doi.org/10.20944/preprints202308.1125.v1
Abstract
Consensus algorithms are the core technology of blockchain and a focus in the current distributed system research. The consensus algorithms are widely used in distributed systems, it has solved the decentralization problem. The traditional consensus algorithm needs the process of node legitimacy checking, identity authentication, and primary node view change, so the time cost of reaching an agreement between nodes is still exponential. In response to the problem, a lightweight consensus algorithm based on graph (LCAG) is proposed for the Internet of Things (IoT) in this paper, which is proposes an access control table, and reaches an agreement among nodes by calculating the probability of nodes in the control table, and reduces the time overhead of the reaching an agreement in distributed systems. We have carried out simulation experiments for the new algorithm, and the experiments show that: the new algorithm needs less time overhead than the classical Byzantine algorithm need, as well as Byzantine Generals problem (BGP), practical Byzantine fault-tolerant algorithm (PBFT) and directed acyclic graph (DAG) algorithm, and so on. The new algorithm can be applied to the devices of IoT, which have limited computing power.
Computer Science and Mathematics, Computer Networks and Communications
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
