Adversarial queuing on the multiple-access channel

Chlebus, Bogdan S.; Kowalski, Dariusz R.; Rokicki, Mariusz A.

doi:10.1145/1146381.1146398

Cited by 55 publications

(72 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In general this depends on the protocol studied, on the size and topology of the network and on the maximum rate at which the adversary is allowed to inject packets into the network. We refer to [2][3][4][5][6][7][8][9][10][11][12][13] for some representative papers under this model. In the second model, a subset of the packets has to be dropped, due to some restriction.…”

Section: Related Workmentioning

confidence: 99%

Packet Forwarding Algorithms in a Line Network

Antoniadis

Barcelo

Cole

et al. 2014

LATIN 2014: Theoretical Informatics

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Packet Forwarding Algorithms in a Line Network

Antoniadis

Barcelo

Cole

et al. 2014

LATIN 2014: Theoretical Informatics

View full text Add to dashboard Cite

show abstract

“…Most of the theoretical work on the design of efficient MAC protocols has focused on random backoff protocols (e.g., [7,11,17,18,25,35]) that do not take jamming activity into account and therefore are not robust against it. MAC protocols have also been designed in the context of broadcasting (e.g., [12]) and clustering (e.g., [23]).…”

Section: Related Workmentioning

confidence: 99%

Principles of Robust Medium Access and an Application to Leader Election

Awerbuch

Richa

Scheideler

et al. 2014

ACM Trans. Algorithms

View full text Add to dashboard Cite

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 time steps, for an arbitrary constant > 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 non-jammed time periods under any adversarial strategy above. 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.1. Introduction. The efficient use of a shared medium is arguable one of the most relevant but also most complex problems in distributed computing. First, a wireless network requires distributed access coordination mechanisms which minimize the internal interference due to simultaneous transmissions from wireless devices in the same network. In addition, the availability of the wireless medium can vary significantly over time due to the external interference, e.g., due to disturbances from other sources such as microwaves, due to transmissions of co-existing (potentially mobile) networks, or due to intentional or even adversarial interruptions. Adversarial attacks constitute a major threat especially since they often do not require any special hardware and may be implemented by simply listening to the open medium and broadcasting in the same frequency band as the network.This article studies the design of distributed medium access schemes which are robust even against a powerful adversary who can block the medium at arbitrary and unpredictable times, and in an adaptive manner (i.e., depending on the protocol history). This adversarial model is used to capture a wide range of interference scenarios. Despite the adversary's power, we show that provably robust medium access solutions exist in the sense that in the time periods where the medium is available, there are many successful transmissions.

show abstract

“…Furthermore, oblivious protocols in which the sequence of transmissions of a node is independent of the received messages have also been studied in [16,7,17]. There are also some other work focusing on dynamic packet arrivals, e.g., in a stochastic model [11], in adversarial queuing models [2,5,17], and message arrivals determined by an adversary [23].…”

Section: Related Workmentioning

confidence: 99%

Information exchange with collision detection on multiple channels

Wang

et al. 2014

J Comb Optim

View full text Add to dashboard Cite

Abstract. Information exchange is a fundamental communication primitive in radio networks. We study this problem in multi-channel singlehop networks. In particular, given k pieces of information, initially stored in k nodes respectively, the task is to broadcast these information pieces to the entire network via a set of F channels. We develop efficient distributed algorithms for this task for the scenario where both the identities and the number k of the initial information holders are unknown to the participating nodes. Assuming nodes with collision detection, we present an efficient randomized algorithm for unrestricted information exchange, where multiple information items can be combined into a single message. The algorithm disseminates all the information items within O( k F + F log 2 n) timeslots with high probability. To the best of our knowledge, this is the first algorithm that breaks the Ω(k) lower bound for unrestricted information exchange if only a single channel is available. This result establishes the superiority of multiple channels for the task of unrestricted information exchange. Moreover, for restricted information exchange, where each message can carry only one information item, we devise a randomized algorithm that completes the task in O(k + log 2 n F + log n) timeslots. When k is large, both algorithms are asymptotically optimal, as they can reach the trivial lower bounds of Ω( k F ) and Ω(k) for unrestricted and restricted information exchange, respectively.

show abstract

Adversarial queuing on the multiple-access channel

Cited by 55 publications

References 26 publications

Packet Forwarding Algorithms in a Line Network

Packet Forwarding Algorithms in a Line Network

Principles of Robust Medium Access and an Application to Leader Election

Information exchange with collision detection on multiple channels

Contact Info

Product

Resources

About