TY - GEN
T1 - Secure communication through jammers jointly optimized in geography and time
AU - Allouche, Yair
AU - Cassuto, Yuval
AU - Efrat, Alon
AU - Segal, Michael
AU - Arkin, Esther M.
AU - Grebla, Guy
AU - Mitchell, Joseph S.B.
AU - Sankararaman, Swaminathan
N1 - Funding Information:
We first showed the benefits of temporal jamming where jammers’ activity on individual bit instants are drawn as i.i.d Bernoulli random variables independent of other jammers. This scheme can be easily extended to the domain of multiple jamming frequencies. Next, we showed how to transform infeasible jamming specifications to feasible ones without any impact to security, reliability and communication rate by changing the coding parameters. Based on this, we presented two polynomial time approximation algorithms for computing jammers’ activity parameters with a (1 + ε)-approximation of the best achievable energy consumption. Our results demonstrate the benefits of choosing coding parameters in conjunction with assigning jammers’ activity to efficiently manage secure reliable communication. Acknowledgment A. Efrat was partially supported by the National Science Foundation (CNS-1017114). G. Grebla was partially supported by the Defense Threat Reduction Agency grant HDTRA 1-13-1-0021. E. Arkin and J. Mitchell were partially supported by the National Science Foundation (CCF-1018388) and by the US-Israel Binational Science Foundation (Grant 2010074).
Funding Information:
A. Efrat was partially supported by the National Science Foundation (CNS-1017114). G. Grebla was partially supported by the Defense Threat Reduction Agency grant HDTRA 1-13-1-0021. E. Arkin and J. Mitchell were partially supported by the National Science Foundation (CCF-1018388) and by the US-Israel Binational Science Foundation (Grant 2010074).
Publisher Copyright:
Copyright © 2015 ACM.
PY - 2015/6/22
Y1 - 2015/6/22
N2 - 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 these sensitive communications 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.
AB - 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 these sensitive communications 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.
UR - http://www.scopus.com/inward/record.url?scp=85027878789&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85027878789&partnerID=8YFLogxK
U2 - 10.1145/2746285.2746322
DO - 10.1145/2746285.2746322
M3 - Conference contribution
AN - SCOPUS:85027878789
T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
SP - 227
EP - 236
BT - MSCC 2015 - Proceedings of the 2nd Workshop for Mobile Sensing, Computing and Communication, co-located with MobiHoc 2015
PB - Association for Computing Machinery
T2 - 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2015
Y2 - 22 June 2015 through 25 June 2015
ER -