Secure communication through jammers jointly optimized in geography and time

Yair Allouche, Esther M. Arkin, Yuval Cassuto, Alon Efrat, Guy Grebla, Joseph S.B. Mitchell, Swaminathan Sankararaman, Michael Segal

Research output: Contribution to journalArticlepeer-review

Abstract

Security-sensitive applications, such as patient health monitoring and credit card transactions, are increasingly utilizing wireless communication systems, RFIDs, wireless sensor networks, and other wireless communication systems. The use of interference-emitting jammers to protect such sensitive communication has been recently explored in the literature, and has shown high potential. In this paper we consider optimization problems relating to the temporal distributions of jammers’ activity, and the suitable coding regimes used for communication. Solving the joint problem optimally enables comprehensive security in space, at a low power consumption and low communication overhead. The joint optimization of jamming in space and time is driven by a new framework that uses the bit-error probability as a measure of communication quality. Under this framework, we show how to guarantee information-theoretic security within a geographic region, and with increased flexibility to tailor the coding regime to the problem's geometry. We present efficient algorithms for different settings, and provide simulations for various scenarios using the bit-error probability functions. These simulations demonstrate the efficiency of the scheme. We believe that our scheme can lead to practical, economical and scalable solutions for providing another layer of protection of sensitive data, in cases where encryption schemes are limited or impractical.

Original languageAmerican English
Pages (from-to)83-105
Number of pages23
JournalPervasive and Mobile Computing
Volume41
DOIs
StatePublished - 1 Oct 2017

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Science Applications
  • Computer Networks and Communications

Cite this