The Community for Technology Leaders
Green Image
Issue No. 04 - July-Aug. (2017 vol. 14)
ISSN: 1545-5971
pp: 392-405
Marco Tiloca , SICS Swedish ICT AB, Kista, Sweden
Domenico De Guglielmo , Department of Information Engineering, University of Pisa, Italy
Gianluca Dini , Department of Information Engineering, University of Pisa, Italy
Giuseppe Anastasi , Department of Information Engineering, University of Pisa, Italy
Sajal K. Das , Department of Computer Science, Missouri University of Science and Technology, Rolla, MO
Time division multiple access (TDMA) is often used in wireless sensor networks (WSNs), especially for critical applications, as it provides high energy efficiency, guaranteed bandwidth, bounded and predictable latency, and absence of collisions. However, TDMA is vulnerable to selective jamming attacks. In TDMA transmission, slots are typically pre-allocated to sensor nodes, and each slot is used by the same node for a number of consecutive superframes. Hence, an adversary could thwart a victim node’s communication by simply jamming its slot(s). Such attack turns out to be effective, energy efficient, and extremely difficult to detect. In this paper, we present JAMMY, a distributed and dynamic solution to selective jamming in TDMA-based WSNs. Unlike traditional approaches, JAMMY changes the slot utilization pattern at every superframe, thus making it unpredictable to the adversary. JAMMY is decentralized, as sensor nodes determine the next slot utilization pattern in a distributed and autonomous way. Results from performance analysis of the proposed solution show that JAMMY introduces negligible overhead yet allows multiple nodes to join the network, in a limited number of superframes.
Jamming, Wireless sensor networks, Time division multiple access, Generators, Monitoring, IEEE 802.15 Standard, Interference

M. Tiloca, D. De Guglielmo, G. Dini, G. Anastasi and S. K. Das, "JAMMY: A Distributed and Dynamic Solution to Selective Jamming Attack in TDMA WSNs," in IEEE Transactions on Dependable and Secure Computing, vol. 14, no. 4, pp. 392-405, 2017.
188 ms
(Ver 3.3 (11022016))