Permissioned blockchain architecture enabling bounded-time PBFT consensus over deterministic networks

Abstract

With the advent of next-generation network, the demand for time-sensitive services in fields such as the IoT the IoD has been increasing. Meanwhile, integrating blockchain technology is becoming increasingly meaningful in IoT scenario due to its enhanced security, transparency and fault tolerance. At this point, to enable blockchain systems to provide time-sensitive services in scenarios such as IIoT, this study proposes an permissioned blockchain architecture based on deterministic network aimed at reaching PBFT consensus in bounded time, referred to as confidence duration (CD). However, congestion can compromise the validity of the CD. To address this, we leverage the PBFT consensus model. This model demonstrates the architecture’s effectiveness by breaking down the consensus process into a series of finite, bounded-latency transmissions, thereby allowing for the calculation of the CD even under potential network congestion. Then, based on this model, this paper proposes a STA scheduling mechanism to address the congestion problem in the PBFT consensus. Finally, our simulations found that the architecture is effective, the computation of CD is correct and the STA scheduling mechanism can effectively address congestion to ensure functionality of CD.