Jinhui Liu

Jinhui Liu


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 September 2023 in Research Square
Verified
Preprint
Open access
PDF file
FWFusheng Wu
Fusheng Wu
XGXiaofeng Gong
Xiaofeng Gong
JLJinhui Liu
Jinhui Liu
YLYanbin Li
Yanbin Li
MNMingtao Ni
Mingtao Ni
Consensus algorithms are the core technology of blockchain and a focus in the current distributed system research. Although the practical Byzantine fault-tolerant (PBFT) algorithm has reduced communication time overhead, it still needs some processes such as node legitimacy checking, identity authentication, and primary node view change, and when reaching an agreement among nodes, time overhead will increase exponentially, rather than polynomial time. In response to the problem, a lightweight consensus algorithm based on graph (LCAG) is proposed for the Internet of Things (IoT) in this paper. The new algorithm proposes an access control table, reduces communication time overhead, quantifies a process for nodes to reach an agreement in distributed systems. The simulation results reveal that in the process for nodes to reach an agreement, the new algorithm needs less time overhead than the classical Byzantine algorithm need, as well as practical Byzantine fault-tolerant algorithm.

16 August 2023 in Preprints.org
Verified
Preprint
Open access
PDF file
FWFusheng Wu
Fusheng Wu
XGXiaofeng Gong
Xiaofeng Gong
JLJinhui Liu
Jinhui Liu
YLYanbin Li
Yanbin Li
MNMingtao Ni
Mingtao Ni
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.