HXHao Xu

Hao Xu

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hao Xu has a total of 42 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • MRPO: An Evolutionary Game-Based Multiple Round Probabilistic Oracle for BIoV

    by Dengcheng Hu, Jianrong Wang, Yiwei Cai, Xiulong Liu, Hao Xu, Haipeng Yao, Bin Xiao, Liehuang Zhu, Wenyu Qu

  • FedShard: A Sharding-Based Federated Learning Framework With Layered Incentivization for IoT

    by Juncheng Ma, Xiulong Liu, Changzhi Li, Hao Xu, Keqiu Li

    The blockchain-based federated learning framework has garnered widespread attention to ensure data privacy and trustworthy computing in IoT devices. Improving the accuracy and scalability are paramount for the increasing demands of IoT tasks. However, existing solutions, such as SIFL and ChainFL, utilize traditional single-chain architecture and fixed models, which exhibit limitations in terms of model generalizability and scalability. To overcome the above problems, this article proposes FedShard, an FL framework that integrates a layered dual-track incentive mechanism and a privacy knowledge distillation module. When implementing FedShard, we address two technical challenges: 1) to ensure efficient training among the numerous clients in the sharding architecture, we propose a layered dual-track incentive mechanism that provides both long- and short-term rewards; and 2) to enhance the framework’s convergence and privacy in sharding-based FL, we design a knowledge distillation module that incorporates local differential privacy (LDP). Furthermore, we propose a bucket-based hash ring to manage clients, enabling the framework to adapt to dynamic network environments. To validate the framework’s generalizability and scalability, we implement FedShard on a 48-core high-performance server using Fabric to conduct both on-chain and off-chain experiments. Our comprehensive experiments, comparing FedShard with SIFL, PEFL, and ChainFL, reveal that our solution outperforms the state-of-the-art methods by achieving a notable 29% increase in accuracy and a 22% improvement in throughput.


  • A Fast and Practical Sector-Based BFT Consensus With Sublinear Communication Complexity

    by Hao Xu, Chenyu Zhang, Xiulong Liu, Yiran Lv, Shiyu Gan, Liehuang Zhu, Keqiu Li

    Byzantine fault-tolerant (BFT) consensus protocols are the core components of blockchain. In the process of improving the performance of BFT protocols, existing work faces the following three problems: 1) the binary dilemma between the leader’s performance bottleneck in star-based linear communication and compromised resilience in tree-based sublinear communication; 2) two- or three-round protocols restrict the phase number of one proposal, thereby limiting the number of concurrent proposals and causing high latency. 3) The fixed timeout makes the protocol sensitive to varying network delays. Therefore, this paper proposes Crackle, the first sector-based pipelined BFT protocol with a sublinear communication complexity, for a throughput improvement of consensus protocol with max resilience of $(\mathcal {N}\textrm {-} 1)/3$ . We propose a sector-based communication mode to disseminate messages from the leader to a subset of replicas in each phase to accelerate consensus and split the traditional two-round protocol into $2\mathsf {\kappa }$ phases to increase the basic pipeline scale. We refine the timer strategy so that the timeout $\Delta $ is adjusted with the proposal submission to cope with the changing network environment. We then address two technical challenges: 1) to ensure Quorum Certificate (QC) validation, we design a $\mathit {voteMap} s$ field within each block, and verify QC by the signature aggregation of $\mathit {voteMap} s$ in continuous $\mathsf {\kappa }$ phases; and 2) to achieve pipeline decoupling among shorter phases, we propose a vote-appending mechanism that relaxes the conditions for the leader to send new proposals. We provide comprehensive theoretical proof of the correctness of Crackle, including safety and $\mathit{liveness}$ . Moreover, we implement Crackle based on a public BFT framework and deploy it on 64 cloud servers. Real experimental results reveal that our Crackle protocol achieves up to 10.36x higher throughput and can dynamically adapt to network delay compared with state-of-the-art BFT protocols such as Kauri and Hotstuff.


  • CoCFL: A Lightweight Blockchain-Based Federated Learning Framework for Large-Scale IoT Cluster

    by Xiulong Liu, Changzhi Li, Yang Shi, Dengcheng Hu, Hao Xu, Jianrong Wang, Keqiu Li

    Blockchain-based Federated Learning (BCFL) has attracted considerable attention in the intelligent IoT domain for its privacy-preserving and decentralized characteristics. Depending on their applicable scenarios, BCFL frameworks are categorized into two types: synchronous and asynchronous. However, synchronous BCFL struggles with low efficiency in heterogeneous IoT environments, while asynchronous BCFL suffers from slow convergence speed. In additional, Both BCFL incur significant resource consumption from blockchain consensus mechanisms which is unrelated to federated learning tasks, leading to resource wastage and poor scalability, making them unsuitable for large-scale IoT networks. To address these challenges, we propose CoCFL, a novel BCFL framework utilizing multi-chain collaboration. CoCFL introduces two lightweight sub-chains: PoCFL-CChain and PC-CChain, based on different FL strategy. PoCFL-CChain uses a synchronous FL strategy for learning devices with similar performance to generate high-accuracy models, while PC-CChain adopts an asynchronous strategy for heterogeneous devices, which can improving training efficiency. CoCFL assigns devices to suitable sub-chains based on their performance to carry out FL tasks and aggregates the sub-chain models into a global model. This multi-chain collaboration strategy enhances model accuracy and convergence speed and significantly improves the scalability of BCFL. In additional, the consensus mechanisms in CoCFL sub-chains not only maintain the blockchain ledger but also handle FL-related tasks such as detecting poisoning attacks, assigning roles, and distributing incentives. This design not only improving the efficiency of BCFL, but also enhances learning security and ensuring fair incentives. Experiments show that CoCFL improves learning accuracy by 6% and efficiency by 18% over existing BCFL frameworks. It also demonstrates excellent scalability, with time consumption liner decreasing as sub-chains increase, and can withstand up to 40% of poisoning attacks while ensuring fair incentives.


  • Open Access

    Orcas: A DAG-based Consensus Approach with Linear Communication Overhead

    by Yi Hua, Xiulong Liu, Hao Xu, Chenyu Zhang, Gaowei Shi, Keqiu Li, Muhammad Shahzad, Guyue (Grace) Liu


  • 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.


  • HydraChain: A Cooperative MAPPO Architecture for Load Balancing in IoT Sharding Blockchain

    by Juncheng Ma, Xiulong Liu, Hao Xu, Dengcheng Hu, Gaowei Shi, Liyuan Ma, Keqiu Li

    Sharding has become a significant approach to enhance blockchain scalability. However, existing sharding techniques applied in IoT scenarios suffer from transaction congestion due to imbalanced distribution of transactions across shards, which hinders intra-shard transaction processing. To overcome the above problems, this article proposes HydraChain in IoT scenarios, the first multiagent reinforcement learning based sharding blockchain system with account graph, for a throughput improvement of shards under real-time load balancing. Agents collaborate by sharing information and jointly optimizing decisions, enhancing the accuracy and efficiency of the decision-making process. We first construct a sharding blockchain environment embedding with a graph encoder. Concurrently, we propose a multiagent model with decoder, which enables agents to cooperative learning to optimize account allocation strategies based on real-time shard load and global system information. When implementing HydraChain, we address two technical challenges: 1) to extract granular behavioral features from accounts with diverse and time-varying patterns, we construct a sharding blockchain that embeds a graph encoder to build a transaction graph; and 2) to ensure real-time load balancing under the constraints of dynamic transaction patterns, we propose SG-MAPPO, which matches graph encoding features within the environment. Our approach leverages the ability of multiagent model to collaborate and adapt to the changing environment, enabling efficient resource allocation and improved system performance. Moreover, we implement HydraChain and conduct experiments on a high-performance server equipped with 48 cores and 125 GB of memory. Our comprehensive experiments, comparing HydraChain with DQN-Based, SAC-Based and SPRING, reveal that our solution outperforms the state-of-the-art methods by achieving a notable 22% increase in transaction throughput and a 5.2% reduction in workload imbalance across shards.


  • 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.


  • Tangram: Enabling Efficient and Balanced Dynamic Storage Extension on Sharding Blockchain Systems

    by Hao Xu, Jiaqi Zhang, Xiulong Liu, Zhimin Yu, Tingyu Fan, Baochao Chen, Keqiu Li

    In recent years, sharding technology has been frequently applied in blockchain systems to increase scalability. However, when new shards are added, the system may result in significant overhead in terms of computing and networking since the data allocation approach is incompatible with dynamic changes in shards. Currently, S-Store, the state-of-the-art sharding solution built on the account model, has a high re-computing latency when growing shard numbers and an unbalanced sharded data distribution after growth. To address these issues, this paper presents Tangram, an efficient and balanced dynamic storage extension approach for sharding blockchain systems. Tangram reduces system extension overhead and latency while ensuring a balanced shard distribution. In implementing Tangram, we tackle three main technical challenges as follows. (1) Designing a novel state tree structure for the storage and maintenance of sharding state data. We introduce the Jump Merkle Tree (JMT) based on the Merkle Tree, which integrates node migration and orderliness. (2) Presenting a protocol to be compatible with dynamic shard scenarios. We devise a shard addition protocol to improve system extension availability and decrease shard extension delay. (3) Proposing an approach to guarantee system longevity after extension. We first devise algorithms for the state tree to eradicate invalid states after system expansion. Furthermore, we introduce a shard reduction protocol to enhance system storage extension support in complex scenarios, such as cleaning up inactive states to avoid bloating the state tree. We conduct extensive experiments to evaluate the performance of Tangram. Experiment results demonstrate that Tangram outperforms existing solutions, showing reduced latency and superior data balance. When compared to the state-of-the-art sharding storage solution, Tangram decreases the transaction execute time by up to 87.84%, the state data migration by more than approximately 74%, and achieves up to 7.63x improvement in the standard deviation of sharding data balance.