Wanning Bao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wanning Bao has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Boris Düdder
University of Copenhagen
1 shared publication - Dian Shen
Southeast University, Nanjing, China
1 shared publication Dongbo Huang
China University of Mining and Technology, Xuzhou 221116, China
1 shared publication- Gang Hua
School of Information and Control Engineering, China University of Mining and Technology, Xuzhou, China
1 shared publication - Haiqiang Liu
China University of Mining and Technology, Xuzhou 221116, China
1 shared publication - Haiqin Wu
Software Engineering Institute, East China Normal University, Shanghai, China
1 shared publication
Latest Publications
- 16 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (3) , 942-956
TolerStore: Tolerating Malicious Nodes in Decentralized Storage Network
A decentralized storage network (DSN) collects idle storage resources from Internet nodes for low-cost rental to users, and its scale has grown exponentially. In a DSN, most users rely on a centralized third-party service provider (SP) to process user-side data and interact with decentralized storage nodes (SNs), making users suffer from a single point of failure. Additionally, since both SP and SNs may offer malicious services, enabling fault tolerance, data confidentiality, and availability guarantee with public verifiability is crucial in the presence of such threats. In this paper, we propose TolerStore, a completely decentralized service framework for DSNs with decentralized SPs and SNs, which can tolerate Byzantine SPs and malicious SNs. To the best of our knowledge, TolerStore is the first to develop a blockchain with multiple SPs for privacy-aware data processing in DSNs, which is formally proven to ensure Byzantine fault tolerance, data confidentiality, public verification, and data availability. Furthermore, we propose an optimized Byzantine Fault-Tolerant consensus with an adaptive leader rotation, incorporating homomorphic fingerprints to verify privacy-aware data processing with enhanced performance. We implement a TolerStore prototype over Hyperledger Fabric, and extensive experiments show that it tolerates$\left\lfloor\frac{N-1}{3}\right\rfloor$ Byzantine SPs and$50\%$ malicious SNs with up to$99.99\%$ data availability.- 16 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (3) , 942-956
TolerStore: Tolerating Malicious Nodes in Decentralized Storage Network
A decentralized storage network (DSN) collects idle storage resources from Internet nodes for low-cost rental to users, and its scale has grown exponentially. In a DSN, most users rely on a centralized third-party service provider (SP) to process user-side data and interact with decentralized storage nodes (SNs), making users suffer from a single point of failure. Additionally, since both SP and SNs may offer malicious services, enabling fault tolerance, data confidentiality, and availability guarantee with public verifiability is crucial in the presence of such threats. In this paper, we propose TolerStore, a completely decentralized service framework for DSNs with decentralized SPs and SNs, which can tolerate Byzantine SPs and malicious SNs. To the best of our knowledge, TolerStore is the first to develop a blockchain with multiple SPs for privacy-aware data processing in DSNs, which is formally proven to ensure Byzantine fault tolerance, data confidentiality, public verification, and data availability. Furthermore, we propose an optimized Byzantine Fault-Tolerant consensus with an adaptive leader rotation, incorporating homomorphic fingerprints to verify privacy-aware data processing with enhanced performance. We implement a TolerStore prototype over Hyperledger Fabric, and extensive experiments show that it tolerates$\left\lfloor\frac{N-1}{3}\right\rfloor$ Byzantine SPs and$50\%$ malicious SNs with up to$99.99\%$ data availability.- Open Access
- 29 October 2018
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2018, 1-9
A Bat-Inspired Sparse Recovery Algorithm for Compressed Sensing
Compressed sensing (CS) is an important research area of signal sampling and compression, and the essence of signal recovery in CS is an optimization problem of solving the underdetermined system of equations. Greedy pursuit algorithms are widely used to solve this problem. They have low computational complexity; however, their recovery performance is limited. In this paper, an intelligence recovery algorithm is proposed by combining the Bat Algorithm (BA) and the pruning technique in subspace pursuit. Experimental results illustrate that the proposed algorithm has better recovery performance than greedy pursuit algorithms. Moreover, applied to the microseismic monitoring system, the BA can recover the signal well.
- 29 October 2018
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2018, 1-9
Open AccessA Bat-Inspired Sparse Recovery Algorithm for Compressed Sensing
Compressed sensing (CS) is an important research area of signal sampling and compression, and the essence of signal recovery in CS is an optimization problem of solving the underdetermined system of equations. Greedy pursuit algorithms are widely used to solve this problem. They have low computational complexity; however, their recovery performance is limited. In this paper, an intelligence recovery algorithm is proposed by combining the Bat Algorithm (BA) and the pruning technique in subspace pursuit. Experimental results illustrate that the proposed algorithm has better recovery performance than greedy pursuit algorithms. Moreover, applied to the microseismic monitoring system, the BA can recover the signal well.