Jamming Attack in Wireless Sensor Network: From Time to Space

Yanqiang SUN  Xiaodong WANG  Xingming ZHOU  

IEICE TRANSACTIONS on Communications   Vol.E95-B   No.6   pp.2113-2116
Publication Date: 2012/06/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.2113
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories for Communications
jamming attack,  wireless sensor network,  hardness,  integer programming,  heuristic,  

Full Text: PDF>>
Buy this Article

Classical jamming attack models in the time domain have been proposed, such as constant jammer, random jammer, and reactive jammer. In this letter, we consider a new problem: given k jammers, how does the attacker minimize the pair-wise connectivity among the nodes in a Wireless Sensor Network (WSN)? We call this problem k-Jammer Deployment Problem (k-JDP). To the best of our knowledge, this is the first attempt at considering the position-critical jamming attack against wireless sensor network. We mainly make three contributions. First, we prove that the decision version of k-JDP is NP-complete even in the ideal situation where the attacker has full knowledge of the topology information of sensor network. Second, we propose a mathematical formulation based on Integer Programming (IP) model which yields an optimal solution. Third, we present a heuristic algorithm HAJDP, and compare it with the IP model. Numerical results show that our heuristic algorithm is computationally efficient.