View in EDS HTML Full Text PDF Full Text

A resource-competitive jamming defense.

Saved in:
Bibliographic Details
Title: A resource-competitive jamming defense.
Authors: King, Valerie1 val@cs.uvic.ca, Pettie, Seth2 pettie@umich.edu, Saia, Jared3 saia@cs.unm.edu, Young, Maxwell4 myoung@cse.msstate.edu
Source: Distributed Computing. Nov2018, Vol. 31 Issue 6, p419-439. 21p.
Subjects: Cell phone jamming, Wireless Application Protocol (Computer network protocol), Telecommunication systems, Internet of things, Security management
Abstract: Consider a scenario where Alice wishes to send a message m to Bob in a time-slotted wireless network. However, there exists an adversary, Carol, who aims to prevent the transmission of m by jamming the communication channel. There is a per-slot cost of 1 to send, receive or jam m on the channel, and we are interested in how much Alice and Bob need to spend relative to Carol in order to guarantee communication. Our approach is to design an algorithm in the framework of resource-competitive analysis where the cost incurred by correct network devices (i.e., Alice and Bob) is parameterized by the cost incurred by faulty devices (i.e., Carol). We present an algorithm that guarantees the successful transmission of m and has the following property: if Carol incurs a cost of T to jam, then both Alice and Bob have a cost of O(Tφ-1+1)=O(T.62+1) in expectation, where φ=(1+5)/2 is the golden ratio. In other words, it possible for Alice and Bob to communicate while incurring asymptotically less cost than Carol. We generalize to the case where Alice wishes to send m to n receivers, and we achieve a similar result. Our findings hold even if (1) T is unknown to either party; (2) Carol knows the algorithms of both parties, but not their random bits; (3) Carol can jam using knowledge of past actions of both parties; and (4) Carol can jam reactively, so long as there is sufficient network traffic in addition to m. [ABSTRACT FROM AUTHOR]
Copyright of Distributed Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 131619701
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A resource-competitive jamming defense.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22King%2C+Valerie%22">King, Valerie</searchLink><relatesTo>1</relatesTo><i> val@cs.uvic.ca</i><br /><searchLink fieldCode="AR" term="%22Pettie%2C+Seth%22">Pettie, Seth</searchLink><relatesTo>2</relatesTo><i> pettie@umich.edu</i><br /><searchLink fieldCode="AR" term="%22Saia%2C+Jared%22">Saia, Jared</searchLink><relatesTo>3</relatesTo><i> saia@cs.unm.edu</i><br /><searchLink fieldCode="AR" term="%22Young%2C+Maxwell%22">Young, Maxwell</searchLink><relatesTo>4</relatesTo><i> myoung@cse.msstate.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Distributed+Computing%22">Distributed Computing</searchLink>. Nov2018, Vol. 31 Issue 6, p419-439. 21p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Cell+phone+jamming%22">Cell phone jamming</searchLink><br /><searchLink fieldCode="DE" term="%22Wireless+Application+Protocol+%28Computer+network+protocol%29%22">Wireless Application Protocol (Computer network protocol)</searchLink><br /><searchLink fieldCode="DE" term="%22Telecommunication+systems%22">Telecommunication systems</searchLink><br /><searchLink fieldCode="DE" term="%22Internet+of+things%22">Internet of things</searchLink><br /><searchLink fieldCode="DE" term="%22Security+management%22">Security management</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Consider a scenario where Alice wishes to send a message m to Bob in a time-slotted wireless network. However, there exists an adversary, Carol, who aims to prevent the transmission of m by jamming the communication channel. There is a per-slot cost of 1 to send, receive or jam m on the channel, and we are interested in how much Alice and Bob need to spend relative to Carol in order to guarantee communication. Our approach is to design an algorithm in the framework of resource-competitive analysis where the cost incurred by correct network devices (i.e., Alice and Bob) is parameterized by the cost incurred by faulty devices (i.e., Carol). We present an algorithm that guarantees the successful transmission of m and has the following property: if Carol incurs a cost of T<inline-graphic></inline-graphic> to jam, then both Alice and Bob have a cost of O(Tφ-1+1)=O(T.62+1)<inline-graphic></inline-graphic> in expectation, where φ=(1+5)/2<inline-graphic></inline-graphic> is the golden ratio. In other words, it possible for Alice and Bob to communicate while incurring asymptotically less cost than Carol. We generalize to the case where Alice wishes to send m to n receivers, and we achieve a similar result. Our findings hold even if (1) T<inline-graphic></inline-graphic> is unknown to either party; (2) Carol knows the algorithms of both parties, but not their random bits; (3) Carol can jam using knowledge of past actions of both parties; and (4) Carol can jam reactively, so long as there is sufficient network traffic in addition to m. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Distributed Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=131619701
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s00446-017-0313-3
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 419
    Subjects:
      – SubjectFull: Cell phone jamming
        Type: general
      – SubjectFull: Wireless Application Protocol (Computer network protocol)
        Type: general
      – SubjectFull: Telecommunication systems
        Type: general
      – SubjectFull: Internet of things
        Type: general
      – SubjectFull: Security management
        Type: general
    Titles:
      – TitleFull: A resource-competitive jamming defense.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: King, Valerie
      – PersonEntity:
          Name:
            NameFull: Pettie, Seth
      – PersonEntity:
          Name:
            NameFull: Saia, Jared
      – PersonEntity:
          Name:
            NameFull: Young, Maxwell
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov2018
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-print
              Value: 01782770
          Numbering:
            – Type: volume
              Value: 31
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: Distributed Computing
              Type: main
ResultId 1