Statistical wormhole detection in sensor networks

Authors:
Levente Buttyán;László Dóra;István Vajda
Affiliations:
Laboratory of Cryptography and System Security (CrySyS), Department of Telecommunications, Budapest University of Technology and Economics, Hungary;Laboratory of Cryptography and System Security (CrySyS), Department of Telecommunications, Budapest University of Technology and Economics, Hungary;Laboratory of Cryptography and System Security (CrySyS), Department of Telecommunications, Budapest University of Technology and Economics, Hungary
Venue:
ESAS'05 Proceedings of the Second European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Year:
2005

Citing 5
Cited 17

Handbook of mathematics (3rd ed.)

Handbook of mathematics (3rd ed.)
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
SECTOR: secure tracking of node encounters in multi-hop wireless networks

Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Visualization of wormholes in sensor networks

Proceedings of the 3rd ACM workshop on Wireless security
A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks

Wireless Networks

Towards provable secure neighbor discovery in wireless networks

Proceedings of the 6th ACM workshop on Formal methods in security engineering
MISPAR: mitigating stealthy packet dropping in locally-monitored multi-hop wireless ad hoc networks

Proceedings of the 4th international conference on Security and privacy in communication netowrks
A practical secure neighbor verification protocol for wireless sensor networks

Proceedings of the second ACM conference on Wireless network security
SeRWA: A secure routing protocol against wormhole attacks in sensor networks

Ad Hoc Networks
A Scalable Security Framework for Reliable AmI Applications Based on Untrusted Sensors

WWIC 2009 Proceedings of the 7th International Conference on Wired/Wireless Internet Communications
UnMask: Utilizing neighbor monitoring for attack mitigation in multihop wireless sensor networks

Ad Hoc Networks
Timing-based localization of in-band wormhole tunnels in MANETs

Proceedings of the third ACM conference on Wireless network security
Secure and robust virtual coordinate system in wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Energy efficient MAC length determination method for statistical en-route filtering using fuzzy logic

ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
MPC: mitigating stealthy power control attacks in wireless ad hoc networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Local connectivity tests to identify wormholes in wireless networks

MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Wormholes no more? localized wormhole detection and prevention in wireless networks

DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Secure neighbor discovery and wormhole localization in mobile ad hoc networks

Ad Hoc Networks
Topological detection on wormholes in wireless ad hoc and sensor networks

IEEE/ACM Transactions on Networking (TON)
On physical-layer identification of wireless devices

ACM Computing Surveys (CSUR)
Fuzzy-based reliable data delivery for countering selective forwarding in sensor networks

UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
LDAC: A localized and decentralized algorithm for efficiently countering wormholes in mobile wireless networks

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.