Exponential separations in the energy complexity of leader election
Energy is often the most constrained resource for battery-powered wireless devices, and
most of the energy is often spent on transceiver usage (ie, transmitting and receiving …
most of the energy is often spent on transceiver usage (ie, transmitting and receiving …
Proof of work without all the work
Proof-of-work (PoW) is an algorithmic tool used to secure networks by imposing a
computational cost on participating devices. Unfortunately, traditional PoW schemes require …
computational cost on participating devices. Unfortunately, traditional PoW schemes require …
Distributed MIS in O (log log n) Awake Complexity
Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in
distributed graph algorithms. Even after four decades of intensive research, the best known …
distributed graph algorithms. Even after four decades of intensive research, the best known …
Interactive communication with unknown noise rate
Alice and Bob want to run a protocol over a noisy channel, where some bits are flipped
adversarially. Several results show how to make an L-bit noise-free communication protocol …
adversarially. Several results show how to make an L-bit noise-free communication protocol …
Sleeping is superefficient: MIS in exponentially better awake complexity
Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in
distributed graph algorithms. Even after four decades of intensive research, the best-known …
distributed graph algorithms. Even after four decades of intensive research, the best-known …
Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
WC Anderton, T Chakraborty, M Young - Distributed Computing, 2021 - Springer
Binary exponential backoff (BEB) is a decades-old algorithm for coordinating access to a
shared channel. In modern networks, BEB plays a crucial role in WiFi and other wireless …
shared channel. In modern networks, BEB plays a crucial role in WiFi and other wireless …
Torbricks: Blocking-resistant tor bridge distribution
Tor is currently the most popular network for anonymous Internet communication. It critically
relies on volunteer nodes called bridges to relay Internet traffic when a user's ISP blocks …
relies on volunteer nodes called bridges to relay Internet traffic when a user's ISP blocks …
Spartan: A framework for sparse robust addressable networks
J Augustine, S Sivasubramaniam - 2018 IEEE International …, 2018 - ieeexplore.ieee.org
A Peer-to-Peer (P2P) network is a dynamic collection of nodes that connect with each other
via virtual overlay links built upon an underlying network (usually, the Internet). Typical P2P …
via virtual overlay links built upon an underlying network (usually, the Internet). Typical P2P …
Bankrupting DoS Attackers Despite Uncertainty
On-demand provisioning in the cloud allows for services to remain available despite
massive denial-of-service (DoS) attacks. Unfortunately, on-demand provisioning is …
massive denial-of-service (DoS) attacks. Unfortunately, on-demand provisioning is …
Scalable and secure computation among strangers: Message-competitive byzantine protocols
The last decade has seen substantial progress on designing Byzantine agreement
algorithms which do not require all-to-all communication. However, these protocols do …
algorithms which do not require all-to-all communication. However, these protocols do …