Statistical Wormhole Detection in Sensor Networks

  • Levente Buttyán
  • László Dóra
  • István Vajda
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3813)


In this paper, we propose two mechanisms for wormhole detection in wireless sensor networks. The proposed mechanisms are based on hypothesis testing and they provide probabilistic results. The first mechanism, called the Neighbor Number Test (NNT), detects the increase in the number of the neighbors of the sensors, which is due to the new links created by the wormhole in the network. The second mechanism, called the All Distances Test (ADT), detects the decrease of the lengths of the shortest paths between all pairs of sensors, which is due to the shortcut links created by the wormhole in the network. Both mechanisms assume that the sensors send their neighbor list to the base station, and it is the base station that runs the algorithms on the network graph that is reconstructed from the received neighborhood information. We describe these mechanisms and investigate their performance by means of simulation.


Sensor Network Short Path Sensor Node Wireless Sensor Network Medium Access Control Protocol 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38, 393–422 (2002)CrossRefGoogle Scholar
  2. 2.
    Bronstein, I.N., Semendjajew, K.A., Musiol, G., Muehlig, H.: Handbook of Mathematics. Springer, Heidelberg (2004)zbMATHGoogle Scholar
  3. 3.
    Čapkun, S., Buttyán, L., Hubaux, J.-P.: SECTOR: secure tracking of node encounters in multi-hop wireless networks. In: Proceedings of the ACM Workshop on Security in Ad Hoc and Sensor Networks, SASN (2003)Google Scholar
  4. 4.
    Hu, L., Evans, D.: Using directional antennas to prevent wormhole attacks. In: Proceedings of the IEEE Symposium on Network and Distributed System Security, NDSS (2004)Google Scholar
  5. 5.
    Hu, Y., Perrig, A., Johnson, D.: Packet leashes: a defense against wormhole attacks in wireless ad hoc networks. In: Proceedings of the IEEE Conference on Computer Communications, Infocom (2003)Google Scholar
  6. 6.
    Karlof, C., Wagner, D.: Secure routing in sensor networks: attacks and countermeasures. Ad Hoc Networks 1, 293–315 (2003)CrossRefGoogle Scholar
  7. 7.
    Poovendran, R., Lazos, L.: A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks. ACM Wireless Networks (to appear)Google Scholar
  8. 8.
    Wang, W., Bhargava, B.: Visualization of wormholes in sensor networks. In: Proceedings of the ACM Workshop on Wireless Security, WiSe (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Levente Buttyán
    • 1
  • László Dóra
    • 1
  • István Vajda
    • 1
  1. 1.Laboratory of Cryptography and System Security (CrySyS), Department of TelecommunicationsBudapest University of Technology and EconomicsHungary

Personalised recommendations