Speed Dating Despite Jammers

Meier, Dominic; Pignolet, Yvonne Anne; Schmid, Stefan; Wattenhofer, Roger

doi:10.1007/978-3-642-02085-8_1

Cited by 34 publications

(21 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Gilbert et al [23] derive bounds on the time required for information exchange when a reactive adversary jams multiple channels. Meier et al [44] examine the delay introduced by a jamming adversary for the problem of node discovery, again in a multi-channel setting. Dolev et al [19] address secure communication using multiple channels with a non-reactive adversary.…”

Section: Related Workmentioning

confidence: 99%

Conflict on a communication channel

King

Saia

Young

2011

Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

Imagine that Alice wants to send a message to Bob, and that Carol wants to prevent this. Assume there is a communication channel between Alice and Bob, but that Carol is capable of blocking this channel. Furthermore, there is a cost of S dollars to send on the channel, L dollars to listen on the channel and J to block the channel. How much will Alice and Bob need to spend in order to guarantee transmission of the message?This problem abstracts many types of conflict in information networks including: jamming attacks in wireless networks and distributed denial-of-service (DDoS) attacks on the Internet, where the costs to Alice, Bob and Carol represent an expenditure of energy and network resources. The problem allows us to quantitatively analyze the economics of information exchange in an adversarial setting and ask: Is communication cheaper than censorship?We answer this question in the affirmative by showing that it is significantly more costly for Carol to block communication of the message than for Alice to communicate it to Bob. Specifically, if S, L and J are fixed constants, and Carol spends a total of B dollars to try to block the message, then Alice and Bob must spend only O(B ϕ−1 +1) = O(B .62 +1) dollars in expectation to transmit the message, where ϕ = (1 + √ 5)/2 is the golden ratio. Surprisingly, this result holds even if (1) the value of B is unknown to both Alice and Bob; (2) Carol knows the algorithms of both Alice and Bob, but not their random bits; and (3) Carol is adaptive: able to launch attacks using total knowledge of past actions of both players.Finally, we apply our work to two concrete problems: (1) denial-of-service attacks in wireless sensor networks and (2) application-level distributed denial-of-service attacks in a wired client-server scenarios. Our applications show how our results can provide an additional tool in mitigating such attacks.

show abstract

Section: Related Workmentioning

confidence: 99%

Conflict on a communication channel

King

Saia

Young

2011

Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

show abstract

“…They also study a setting allowing the nodes to exchange authenticated messages despite a malicious adversary that can cause collisions and spoof messages [10], and present new bounds on broadcasting [11]. Another line of work focuses on the bootstrap problem where nodes have to find each other despite adversarial jammers [23,8,4]. Awerbuch et al [3] present a MAC protocol for single-hop networks that is provably robust to an adaptive adversary that can jam (in a blocking style) a (1 − )-fraction of the rounds.…”

Section: Related Workmentioning

confidence: 99%

Frequency Hopping against a Powerful Adversary

Emek

Wattenhofer

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Frequency hopping is a central method in wireless communication, offering improved resistance to adversarial interference and interception attempts, and easy non-coordinated control in dynamic environments. In this paper, we introduce a new model that supports a rigorous study of frequency hopping in adversarial settings. We then propose new frequency hopping protocols that allow a sender-receiver pair to essentially use the full communication capacity, despite a powerful adversary that can scan and jam a significant amount of the ongoing transmissions.

show abstract

“…[1,11,16,17]), or bounds the number of channels the adversary can jam (e.g. [8,9,10,19]). The protocols in, e.g., [17] can tackle adversarial jamming at both the MAC and network layers, where the adversary may not only jam the channel but also introduce malicious (fake) messages (possibly with address spoofing).…”

Section: Related Workmentioning

confidence: 99%

Competitive and fair throughput for co-existing networks under adversarial interference

Richa

Scheideler

Schmid

et al. 2012

Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε 2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.

show abstract

Speed Dating Despite Jammers

Cited by 34 publications

References 20 publications

Conflict on a communication channel

Conflict on a communication channel

Frequency Hopping against a Powerful Adversary

Competitive and fair throughput for co-existing networks under adversarial interference

Contact Info

Product

Resources

About