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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.