【Author】
Ma, Shengcheng; Wang, Shuai; Tsai, Wei-Tek
【Source】IEEE WIRELESS COMMUNICATIONS LETTERS
【Abstract】Blockchain has been witnessed a growing application in mobile communication. The application field ranges from the Internet of Things (IoT), Vehicle to Everything (V2X), Mobile Edge Computing (MEC), etc. The conjunction with blockchain can significantly avoid data tempering and protect user privacy. Although blockchain guarantees the security of mobile communication, the operation cost is increasing. The consensus algorithm of blockchain drives multiple untrust parties to keep data consistency, and it generates a large number of communication overheads. In this letter, we focus on the Byzantine Fault Tolerance (BFT) type of consensus and conduct a performance model. By utilizing the deterministic network calculus method, we analyze the delay bound of the Practical Byzantine Fault Tolerance (PBFT) and HotStuff consensus algorithm. The result of the simulation provides a valuable guideline for delay-sensitive blockchain-based applications.
【Keywords】Delays; Blockchains; Calculus; Task analysis; Complexity theory; Peer-to-peer computing; Mobile communication; Blockchain; PBFT; HotStuff; delay analysis; network calculus
评论