In this paper, we study fault-tolerant distributed consensus in wireless systems. In more detail, we produce two new randomized algorithms that solve this problem in the abstract …
L Tseng, Q Zhang - Proceedings of the 2022 ACM Symposium on …, 2022 - dl.acm.org
This paper explores fault-tolerant algorithms in the abstract MAC layer [7] in a single-hop network. The model captures the basic properties of modern wireless MAC protocols …
We consider the fault-tolerant consensus problem in wireless ad hoc networks with crash- prone nodes. We develop consensus algorithms for single-hop environments where the …
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst …
We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all …
Fault-tolerant consensus has received significant attention over the past three decades since the seminal work by Lamport, Shostak, and Pease [33, 26]. The consensus problem …
G Jing, Y Zou, Z Zhang, D Yu… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
The openness of wireless networks opens the door to Byzantine attacks on the physical channels, making the communications unreliable and resulting in more challenges in …
We study Consensus in synchronous networks with arbitrary connected topologies. Nodes may be faulty, in the sense of either Byzantine or proneness to crashing. Let t denote a …
We consider the fault-tolerant consensus problem in radio networks with crash-prone nodes. Specifically, we develop lower bounds and matching upper bounds for this problem in single …