A Fast Consensus for Permissioned Wireless Blockchains

With the wide deployment of Internet of Things (IoT), blockchain systems have been playing a crucial role to establish a trusted computing environment among potentially mistrusting agents without depending on a centralized server. Different from previous blockchain consensus protocols adopted in IoT, which rely on efficient and stable transmissions, in this article, we consider how to reach blockchain consensus in wireless networks without reliable network support. Specifically, a realistic signal to interference plus noise ratio (SINR) model is adopted to depict the unreliable transmissions in wireless channels. Based on the SINR model, a distributed and randomized consensus algorithm is proposed to reach k-times consensus among n devices within O(k + log n) time steps with high probability. Note that the time complexity of our algorithm is asymptotically optimal since Omega (k+ log n) is a lower bound to achieve k-times consensus in a distributed environment. We conduct both rigorous theoretical analysis and extensive simulations to validate our method. It is believed that our work can facilitate the implementation of blockchains in many wireless scenarios in which the reliable and fast transmissions cannot be guaranteed.

Automated summary

With the wide deployment of IoT, blockchain systems are crucial for establishing trusted computing environments without relying on centralized servers. This article proposes a distributed and randomized consensus algorithm based on a realistic SINR model to reach k-times consensus among n devices in wireless networks. The algorithm achieves a time complexity of O(k + log n) and has been rigorously analyzed and validated through extensive simulations. The work facilitates the implementation of blockchains in wireless scenarios without reliable and fast transmissions.