# wChain: A Fast Fault-Tolerant Blockchain Protocol for Multihop Wireless Networks

arXiv: https://arxiv.org/abs/2102.01333 · HTML: https://mlsanity.com/paper/2102.01333/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 Feb 2021.

## Built on by (most cited first, 2 of 2)

- [BC4LLM: Trusted Artificial Intelligence When Blockchain Meets Large Language Models](https://mlsanity.com/paper/2310.06278/) (2023)
- [Retrieval-Augmented Generation for Mobile Edge Computing via Large Language Model](https://mlsanity.com/paper/2412.20820/) (2024)

## Abstract (arXiv)

This paper presents mathitwChain, a blockchain protocol specifically designed for multihop wireless networks that deeply integrates wireless communication properties and blockchain technologies under the realistic SINR model. We adopt a hierarchical spanner as the communication backbone to address medium contention and achieve fast data aggregation within O(log NlogGamma) slots where N is the network size and Gamma refers to the ratio of the maximum distance to the minimum distance between any two nodes. Besides, mathitwChain employs data aggregation and reaggregation, and node recovery mechanisms to ensure efficiency, fault tolerance, persistence, and liveness. The worst-case runtime of mathitwChain is upper bounded by O(flog NlogGamma), where f=lfloor fracN2 rfloor is the upper bound of the number of faulty nodes. To validate our design, we conduct both theoretical analysis and simulation studies, and the results only demonstrate the nice properties of mathitwChain, but also point to a vast new space for the exploration of blockchain protocols in wireless networks.