%0 Journal Article
%A NIE Kai-jun
%A PENG Mu-gen
%A ZHANG Lei
%A ZHOU Zhi-zhong
%A CAO Bin
%T Overhead Analysis of Blockchain Consensus Algorithm in Wireless Networks
%D 2020
%R 10.13190/j.jbupt.2020-206
%J Journal of Beijing University of Posts and Telecommunications
%P 140-146
%V 43
%N 6
%X In order to provide a reasonable evaluation for the choice of blockchain type, proof of work (PoW) and practical Byzantine fault tolerance (PBFT) are treated as the benchmark of typical public and private chains for blockchain selection evaluation, and the overhead of blockchain in wireless networks is studied. Firstly, a fair network system and standard blockchain procedure have been provided, and then, considering the impact of block loss generated by transmission failure, the forking probability in PoW and view change probability in PBFT have been analyzed. Moreover, how network scale affects the communication and computation overhead in PoW and PBFT has been also investigated. Finally, the experimental results show that the computational overhead of PBFT is much smaller than that of PoW, the communication overhead of PBFT is greatly affected by the scale of the node, and thus the scalability of PBFT is poor. In contrast, the overhead of PoW communication is affected by the network scale linearly, and the scalability is much better compared with PBFT.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2020-206