ZZZhiyuan Zheng

Zhiyuan Zheng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zhiyuan Zheng has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • AirBFT: An Efficient and Robust Consensus Mechanism for Large-Scale Drone Collaboration

    by Zhongju Yan, Chenyu Zhang, Zhiyuan Zheng, Yiran Lv, Hao Xu, Xiulong Liu, Song Zhang, Sheng Chen, Xiaoyi Tao, Keqiu Li

    The application scenarios of drone collaboration are rapidly expanding, such as the low-altitude economy and wildfire protection. Blockchain-based drone collaboration requires a consensus mechanism to ensure efficient and secure consistency among large-scale distributed nodes. However, the existing consensus mechanism has problems with poor fault tolerance of topology and rigid proposal concurrence. To this end, this article proposes AirBFT, an efficient and robust consensus mechanism for large-scale drone collaboration. First, this article designs a new four-layer network topology, using upper-member and lower-member communication, while ensuring the maximum 1/3 resilience and fan-out of $\sqrt {N}$ . Second, this article proposes a dynamic pipelining algorithm to adjust the parallelism of proposals according to the real-time network status. Finally, this article proposes a committee sampling technology based on the EigenTrust algorithm to reduce the impact of the malicious behavior of Byzantine nodes. Experiments based on the public consensus framework show that compared with Kauri and HotStuff, the proposed AirBFT reduces transaction confirmation delay by 58%, the throughput is increased by 1.9 times, and it can ensure efficient operation with a 1/3 Byzantine node ratio.


  • Enabling Consistent Sensing Data Sharing Among IoT Edge Servers via Lightweight Consensus

    by Xiulong Liu, Zhiyuan Zheng, Hao Xu, Zhelin Liang, Gaowei Shi, Chenyu Zhang, Keqiu Li

    Blockchain offers distinct advantages in terms of data credibility and provenance certification, and its fusion with Internet of Things (IoT) technology holds great promise. Nevertheless, IoT environments are marked by extensive node networks and intricate communication patterns, especially the sensing environment. The conventional blockchain consensus mechanism, hampered by its heavy reliance on computing resources and communication bandwidth, faces difficulties in ensuring seamless data exchange among IoT edge servers. The issues encountered by state-of-the-art Byzantine Fault Tolerance (BFT) consensus include: (i) high communication complexity between nodes; and (ii) the detrimental impact of Byzantine behavior on system performance. To overcome the above problems, we propose the lightweight blockchain consensus called AntB, firstly introducing the concept of sampling into the consensus and significantly reducing the number of participating consensus nodes from $N$ to $n$, which lowers the consensus complexity to $\mathbf{2\cdot O(n)+O(N)}$. We design a dynamic reputation mechanism so that Byzantine nodes cannot control the sampling set to affect the activity of the consensus in the long term. When implementing AntB, we address three significant technical challenges: (i) to determine the optimal sample size, we propose a sampling calculation method based on statistical confidence intervals, where the sample size is primarily determined by the chosen confidence level and margin of error; (ii) to prevent Byzantine behavior, we devise a weighted random sampling mechanism utilizing reputation coefficients based on edge servers’ behaviors; and (iii) to maintain consensus activity and consistency after sampling, we propose the consensus mechanism for partial sampling and global verification to avert potential issues. We implement AntB and conduct performance evaluations in a server with 32 cores and 64GB of memory. The evaluation results indicate that, the more nodes participating in the process of consensus, the better the performance of AntB will be. Especially, compared to HotStuff, AntB has a 24.94% higher success rate and Transactions Per Second (TPS) can improve by 102.10% when the number of nodes is 300.


  • Towards Cost-Effective and Robust Packaging in Multi-Leader BFT Blockchain Systems

    by Xiulong Liu, Zhiyuan Zheng, Wenbin Wang, Hao Xu, Fengjun Xiao, Keqiu Li

    In Byzantine fault-tolerant (BFT) systems, maintaining consistency amidst malicious replicas is crucial, especially for blockchain systems. Recent innovations in this field have integrated multiple leaders into the BFT consensus mechanism to boost scalability and efficiency. However, the existing approaches often lead to excessive consumption of storage, bandwidth, and CPU resources due to redundant transactions. And the attempting to mitigate resource wastage inadvertently reduces resilience against Byzantine failures. To this end, we propose PeterHofe, an innovative ring-based approach for collaborative transaction processing. PeterHofe focuses on balancing resource utilization and minimizing the influence of Byzantine leaders, thereby enhancing transaction processing speed and overall system reliability. PeterHofe innovates by partitioning the transaction hash space into various buckets and creating a complex mappings between these buckets and the replicas, effectively reducing the control of Byzantine replicas. In developing PeterHofe, we concentrate on three primary objectives: 1) the creation of a permutation-based ring structure that enhances resistance to Byzantine censorship, backed by thorough mathematical proofs and analyses; 2) the development of a Prophecy-Implementation mechanism aimed at minimizing transaction replication while scrutinizing potential malicious activities; 3) to ensure the applicability of our proposed method across various types of multi-leader BFT consensus protocols, we have developed an additional asynchronous protocol to ensure consistent application of the packaging strategy. We have implemented PeterHofe using the latest significant frameworks, Narwhal and Tusk, and our empirical results affirm its capability to simultaneously minimize resource waste and bolster system robustness. Specifically, PeterHofe demonstrates efficiency in resource utilization, achieving a 20-fold reduction of resource waste when compared to the Random-based Strategy. When against the advanced Hash-based Partitioning Strategy, it reduces malicious transaction control by at least 66 $\%$ , leading to up to 75 $\%$ lower latency. In scenarios of high traffic, our approach significantly outperforms existing strategies in throughput. Against the Random-based Strategy, it achieves a 6.11 $\%$ increase, and when compared to the Hash-based Partitioning Strategy, the improvement is 20 $\%$ .