Principles of robust medium access and an application to leader election

Baruch Awerbuch, Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 ? ∈)-fraction of the timesteps, for an arbitrary constant isin; > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing.

Original languageEnglish (US)
Article number24
JournalACM Transactions on Algorithms
Volume10
Issue number4
DOIs
StatePublished - 2014

Fingerprint

Leader Election
Medium Access Control
Jamming
Wireless Networks
Vertex of a graph
Interference
Arbitrary
Asymptotically Optimal
Distributed Computing
Throughput
Collision
Entire
Unknown
Range of data
Demonstrate
Knowledge
Model

Keywords

  • Jamming
  • MAC protocols
  • Wireless ad-hoc networks

ASJC Scopus subject areas

  • Mathematics (miscellaneous)

Cite this

Principles of robust medium access and an application to leader election. / Awerbuch, Baruch; Richa, Andrea; Scheideler, Christian; Schmid, Stefan; Zhang, Jin.

In: ACM Transactions on Algorithms, Vol. 10, No. 4, 24, 2014.

Research output: Contribution to journalArticle

Awerbuch, Baruch ; Richa, Andrea ; Scheideler, Christian ; Schmid, Stefan ; Zhang, Jin. / Principles of robust medium access and an application to leader election. In: ACM Transactions on Algorithms. 2014 ; Vol. 10, No. 4.
@article{8a60b95ec60942019875a0a2a4ec1a75,
title = "Principles of robust medium access and an application to leader election",
abstract = "This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 ? ∈)-fraction of the timesteps, for an arbitrary constant isin; > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing.",
keywords = "Jamming, MAC protocols, Wireless ad-hoc networks",
author = "Baruch Awerbuch and Andrea Richa and Christian Scheideler and Stefan Schmid and Jin Zhang",
year = "2014",
doi = "10.1145/2635818",
language = "English (US)",
volume = "10",
journal = "ACM Transactions on Algorithms",
issn = "1549-6325",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Principles of robust medium access and an application to leader election

AU - Awerbuch, Baruch

AU - Richa, Andrea

AU - Scheideler, Christian

AU - Schmid, Stefan

AU - Zhang, Jin

PY - 2014

Y1 - 2014

N2 - This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 ? ∈)-fraction of the timesteps, for an arbitrary constant isin; > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing.

AB - This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 ? ∈)-fraction of the timesteps, for an arbitrary constant isin; > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing.

KW - Jamming

KW - MAC protocols

KW - Wireless ad-hoc networks

UR - http://www.scopus.com/inward/record.url?scp=84906854664&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906854664&partnerID=8YFLogxK

U2 - 10.1145/2635818

DO - 10.1145/2635818

M3 - Article

VL - 10

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

SN - 1549-6325

IS - 4

M1 - 24

ER -