Interference Free Group Testing and Reactive Jamming Attacks

  • My T. ThaiEmail author
Part of the SpringerBriefs in Optimization book series (BRIEFSOPTI)


Another application of group testing that we would like to introduce is to against reactive jamming attacks , which has emerged as a great security threat to wireless sensor networks, due to its mass destruction to legitimate sensor communications and difficulty to be disclosed and defended. There exist many studies against these attacks, however, these methods, i.e., frequency hopping or channel surfing, require excessive computational capabilities on wireless devices. To overcome the shortcomings, we present here an interference free group-testing based solution by identifying the trigger nodes, whose transmissions activate any reactive jammers. The identification of these trigger nodes can help us to (1) carefully design a better routing protocol by switching these nodes into only receivers to avoid activating jammers and (2) locate the jammers based on the trigger nodes, thus providing an alternative mechanism against reactive jamming attacks. The theoretical analysis and experimental results show that this advanced scheme performs well in terms of time and message complexities.


Sensor Node Wireless Sensor Network Transmission Range Packet Delivery Ratio Unit Disk Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Xu W, Ma K, Trappe W, Zhang Y (2006) Jamming sensor networks: attack and defense strategies. IEEE Network 20(3):41–47Google Scholar
  2. 2.
    Strasser M, Danev B, Capkun S (2010) Detection of reactive jamming in sensor networks. ACM Trans Sens Netw (TOSN) 7(2):1–29Google Scholar
  3. 3.
    Tague P, Nabar S, Ritcey JA, Poovendran R (2010) Jamming-aware traffic allocation for multiple-path routing using portfolio selection. IEEE/ACM Trans Networking 19(1):184–194Google Scholar
  4. 4.
    Mingyan Li, Koutsopoulos I, Poovendran R (2007) Optimal jamming attacks and network defense policies in wireless sensor networks. In: 26th, IEEE international conference on computer communications (INFOCOM), pp 1307–1315Google Scholar
  5. 5.
    Xu W, Trappe W, Zhang Y, Wood T (2005) The feasibility of launching and detecting jamming attacks in wireless networks. In: Proceedings of the 6th ACM international symposium on mobile ad hoc networking and computing (MobiHoc), pp 46–57Google Scholar
  6. 6.
    Cagalj M, Capkun S, Hubaux JP (2007) Wormhole-based antijamming techniques in sensor networks. IEEE Trans Mob Comput 6(1):100–114Google Scholar
  7. 7.
    Hang W, Zanji W, Jingbo G (2006) Performance of DSSS against repeater jamming. In: 13th IEEE international conference on electronics, circuits and systems (ICECS), pp 858–861Google Scholar
  8. 8.
    Sidek O, Yahya A (2008) Reed solomon coding for frequency hopping spread spectrum in jamming environment. Am J Appl Sci 5(10):1281–1284Google Scholar
  9. 9.
    Xu W, Wood T, Trappe W, Zhang Y (2004) Channel surfing and spatial retreats: defenses against wireless denial of service. ACM workshop on wireless security, pp 80–89Google Scholar
  10. 10.
    Wood AD, Stankovic J, Son S (2003) A jammed-area mapping service for sensor networks. In: 24th IEEE conference on real-time systems symposium (RTSS), pp 286–297Google Scholar
  11. 11.
    Shin I, Shen Y, Xuan Y, Thai MT, Znati T (2009) Reactive jamming attacks in multi-radio wireless sensor networks: an efficient mitigating measure by identifying trigger nodes. In: Proceedings of the 2nd ACM international workshop on foundations of wireless ad hoc and sensor networking and computing (FOWANC), pp 87–96Google Scholar
  12. 12.
    Shin I, Shen Y, Xuan Y, Thai MT, Znati T (2011) A novel approach against reactive jamming attacks, ad hoc and sensor wireless network, to appear ad hoc and sensor wireless networks 12(1–2):125–149Google Scholar
  13. 13.
    Bomze IM, Marco Budinich, Pardalos PM, Pelillo M (1999) Maximum clique problem, in handbook of combinatorial optimization. Kluwer Academic Publisher, Dordrecht, pp 1–74Google Scholar
  14. 14.
    Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Commun ACM 16(9):575–577Google Scholar
  15. 15.
    Gupta R, Walrand J (2004) Approximating maximal cliques in ad-hoc networks, 15th IEEE international symposium on personal, indoor and mobile radio communications (PIMRC), vol 1. pp 365–369Google Scholar
  16. 16.
    Xuan Y, Shen Y, Nguyen NP, Thai MT (2011) A trigger identification service for defending reactive jammers in WSNs. IEEE Trans Mob Comput 99:, May 2011Google Scholar
  17. 17.
    Kaplan H, Katz M, Morgenstern G, Sharir M (2010) Optimal cover of points by disks in a simple polygon. In: Proceedings of the 18th annual European conference on algorithms:Part I (ESA), pp 475–486Google Scholar

Copyright information

© My T. Thai 2012

Authors and Affiliations

  1. 1.Department of Computer and Information Science and EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations