Of malicious motes and suspicious sensors
Name
Gilbert-2009-Of malicious motes a.pdf
Size
1.78 MB
Format
Adobe PDF
Checksum (MD5)
f784b511ba2a3a2fe98aa9b0d7f7379c
Author(s)
Gilbert, Seth
Guerraoui, Rachid
Newport, Calvin Charles
Date Issued
October 2008
Journal
Theoretical Computer Science
Publisher
Elsevier
Citation
Gilbert, Seth, Rachid Guerraoui, and Calvin Newport. “Of Malicious Motes and Suspicious Sensors.” Theoretical Computer Science 410, no. 6–7 (February 2009): 546–569. © 2008 Elsevier B.V.
Version
Final published version
Abstract
How efficiently can a malicious device disrupt a single-hop wireless network? Imagine two honest players attempting to exchange information in the presence of a malicious adversary that can disrupt communication by jamming or overwriting messages. Assume the adversary has a broadcast budget of β—unknown to the honest players. We show that communication can be delayed for 2β+Θ(lg|V|) rounds, where V is the set of values that the honest players may transmit. We then derive, via reduction to this 3-player game, round complexity lower bounds for several classical nn-player problems: 2β+Ω(lg|V| for reliable broadcast, 2β+Ω(logn) for leader election, and 2β+Ω(klg|V| [over k]) for static k-selection. We also consider an extension of our adversary model that includes up to t crash failures. Here we show a bound of 2β+Θ(t) rounds for binary consensus. We provide tight, or nearly tight, upper bounds for all four problems. From these results we can derive bounds on the efficiency of malicious disruption, stated in terms of two new metrics: jamming gain (the ratio of rounds delayed to adversarial broadcasts) and disruption-free complexity (the rounds required to terminate in the special case of no disruption). Two key conclusions of this study: (1) all the problems considered feature semantic vulnerabilities that allow an adversary to disrupt termination more efficiently than simple jamming (i.e., all have a jamming gain greater than 1); and (2) for all the problems considered, the round complexity grows linearly with the number of bits to be communicated (i.e., all have a Ω(lg|V|) or Ω(lgn) disruption-free complexity.)
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.tcs.2008.10.008
