Consensus with an abstract MAC layer

C Newport - Proceedings of the 2014 ACM symposium on …, 2014 - dl.acm.org
In this paper, we study distributed consensus in the radio network setting. We produce new
upper and lower bounds for this problem in an abstract MAC layer model that captures the …

Fault-tolerant consensus with an abstract MAC layer

C Newport, P Robinson - arXiv preprint arXiv:1810.02848, 2018 - arxiv.org
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 …

Brief announcement: Computability and anonymous storage-efficient consensus with an abstract mac layer

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 …

Consensus and collision detectors in wireless ad hoc networks

G Chockler, M Demirbas, S Gilbert, C Newport… - Proceedings of the …, 2005 - dl.acm.org
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 …

Coordinated consensus in dynamic networks

F Kuhn, Y Moses, R Oshman - Proceedings of the 30th annual ACM …, 2011 - dl.acm.org
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 …

Breaking the ilde Omega (sqrtn) Barrier: Fast Consensus under a Late Adversary

P Robinson, C Scheideler, A Setzer - … of the 30th on Symposium on …, 2018 - dl.acm.org
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 …

A note on fault-tolerant consensus in directed networks

L Tseng, NH Vaidya - ACM SIGACT News, 2016 - dl.acm.org
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 …

Byzantine fault tolerant consensus in open wireless networks via an abstract mac layer

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 …

Fast agreement in networks with byzantine nodes

BS Chlebus, DR Kowalski… - … Symposium on Distributed …, 2020 - drops.dagstuhl.de
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 …

Consensus and collision detectors in radio networks

G Chockler, M Demirbas, S Gilbert, N Lynch… - Distributed …, 2008 - Springer
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 …