This paper presents $\mathit {wChain}$ , 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 N\log \Gamma)$ 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, $\mathit {wChain}$ employs data aggregation and reaggregation as well as node recovery mechanisms to ensure efficiency, fault tolerance, persistence, and liveness. The worst-case runtime of $\mathit {wChain}$ is upper bounded by $O(f\log N\log \Gamma)$ , where $f=\lfloor \frac {N}{2} \rfloor $ is the upper bound of the number of faulty nodes. To validate our design, we conduct both theoretical analysis and simulation studies. The results not only demonstrate the nice properties of $\mathit {wChain}$ , but also point to a large new space for the exploration of blockchain protocols in wireless networks.

中文翻译：

---

wChain：用于多跳无线网络的快速容错区块链协议

本文提出 $\mathit {wChain}$ ，一种专为多跳无线网络设计的区块链协议，在现实的 SINR 模型下深度集成了无线通信特性和区块链技术。我们采用分层生成器作为通信主干来解决介质争用并实现内部快速数据聚合 $O(\log N\log \Gamma)$ 插槽在哪里 $N$ 是网络规模和 $\伽马 $ 指任意两个节点之间最大距离与最小距离的比值。除了， $\mathit {wChain}$ 采用数据聚合和重新聚合以及节点恢复机制来确保效率、容错性、持久性和活性。最坏情况下的运行时间 $\mathit {wChain}$ 上限为 $O(f\log N\log \Gamma)$ ， 在哪里 $f=\lfloor \frac {N}{2} \rfloor $ 是故障节点数的上限。为了验证我们的设计，我们进行了理论分析和模拟研究。结果不仅证明了 $\mathit {wChain}$ ，但也为探索无线网络中的区块链协议指明了一个巨大的新空间。