ar X iv : 1 30 7 . 57 14 v 1 [ cs . C R ] 2 2 Ju l 2 01 3 Silence is Golden exploiting jamming and radio silence to communicate ∗

نویسندگان

  • Roberto Di Pietro
  • Gabriele Oligeri
چکیده

Jamming techniques require just moderate resources to be deployed, while their effectiveness in disrupting communications is unprecedented. In this paper we introduce several contributions to jamming mitigation. In particular, we introduce a novel adversary model that has both (unlimited) jamming reactive capabilities as well as powerful (but limited) proactive jamming capabilities. Under this powerful but yet realistic adversary model, the communication bandwidth provided by current anti-jamming solutions drops to zero. We then present Silence is Golden (SiG): a novel anti jamming protocol that, introducing a tunable, asymmetric communication channel, is able to mitigate the adversary capabilities, enabling the parties to communicate. For instance, with SiG it is possible to deliver a 128 bits long message with a probability greater than 99% in 4096 time slots in the presence of a jammer that jams all the on-the-fly communications and the 74% of the silent radio spectrum—while competing proposals simply fail. The provided solution enjoys a thorough theoretical analysis and is supported by extensive experimental results, showing the viability of our proposal.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 1 30 7 . 39 13 v 1 [ cs . C C ] 1 5 Ju l 2 01 3 PEBBLE GAMES , PROOF COMPLEXITY , AND TIME - SPACE TRADE - OFFS

Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space...

متن کامل

Synthetic Language Generation and Model Validation in BEAST2

Generating synthetic languages aids in the testing and validation of future computational linguistic models and methods. This thesis extends the BEAST2 phylogenetic framework to add linguistic sequence generation under multiple models. The new plugin is then used to test the effects of the phenomena of word borrowing on the inference process under two widely used phylolinguistic models. ar X iv...

متن کامل

ar X iv : 1 71 0 . 05 14 0 v 1 [ cs . C C ] 1 4 O ct 2 01 7 On complexity of multidistance graph recognition in R 1 Mikhail Tikhomirov

Let A be a set of positive numbers. A graph G is called an Aembeddable graph in R if the vertices of G can be positioned in R so that the distance between endpoints of any edge is an element of A. We consider the computational problem of recognizing A-embeddable graphs in R1 and classify all finite sets A by complexity of this problem in several natural variations.

متن کامل

ar X iv : h ep - t h / 01 07 24 2 v 1 2 7 Ju l 2 00 1 Operator Product Expansion in Logarithmic Conformal Field Theory

In logarithmic conformal field theory, primary fields come together with logarithmic partner fields on which the stress-energy tensor acts non-diagonally. Exploiting this fact and global conformal invariance of two-and three-point functions, operator product expansions of logarithmic operators in arbitrary rank logarithmic conformal field theory are derived.

متن کامل

ar X iv : h ep - p h / 01 07 14 8 v 1 1 3 Ju l 2 00 1 b → sγ in a Calculable Model of Electroweak Symmetry Breaking

In a recently proposed extension of the Standard Model with a compact extra dimension of size R we compute the leading corrections, of relative order (mtR) 2, to the Branching Ratio BR(B → Xsγ). For R = (370 ± 80GeV )−1 the branching ratio is increased in a significant way relative to the SM, although not at the level of being inconsistent with present measurements.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013