Topological detection on wormholes in wireless ad hoc and sensor networks

Authors:
Dezun Dong;Mo Li;Yunhao Liu;Xiang-Yang Li;Xiangke Liao
Affiliations:
School of Computer and the National Laboratory for Paralleling and Distributed Processing, National University of Defense Technology, Changsha, China;School of Computer Engineering, Nanyang Technological University, Singapore;TNLIST, School of Software, Tsinghua University, Beijing, China and The Hong Kong University of Science and Technology, Kowloon, Hong Kong;Department of Computer Science, Illinois Institute of Technology, Chicago, IL;School of Computer and the National Laboratory for Paralleling and Distributed Processing, National University of Defense Technology, Changsha, China
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2011

Citing 18
Cited 0

Optimally cutting a surface into a disk

Proceedings of the eighteenth annual symposium on Computational geometry
A Secure Routing Protocol for Ad Hoc Networks

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Secure Link State Routing for Mobile Ad Hoc Networks

SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
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
TinySec: a link layer security architecture for wireless sensor networks

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Wormhole Attacks Detection in Wireless Ad Hoc Networks: A Statistical Analysis Approach

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18
Greedy optimal homotopy and homology generators

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
LITEWORP: A Lightweight Countermeasure for the Wormhole Attack in Multihop Wireless Networks

DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Event-to-sink reliable transport in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Defending against wormhole attacks in mobile ad hoc networks: Research Articles

Wireless Communications & Mobile Computing
Boundary recognition in sensor networks by topological methods

Proceedings of the 12th annual international conference on Mobile computing and networking
A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks

Wireless Networks
MiniSec: a secure sensor network communication architecture

Proceedings of the 6th international conference on Information processing in sensor networks
TrueLink: A Practical Countermeasure to the Wormhole Attack in Wireless Networks

ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Impact of denial of service attacks on ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Statistical wormhole detection in sensor networks

ESAS'05 Proceedings of the Second European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Location-based compromise-tolerant security mechanisms for wireless sensor networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wormhole attack is a severe threat to wireless ad hoc and sensor networks. Most existing countermeasures either require specialized hardware devices or make strong assumptions on the network in order to capture the specific (partial) symptom induced by wormholes. Those requirements and assumptions limit the applicability of previous approaches. In this paper, we present our attempt to understand the impact and inevitable symptom of wormholes and develop distributed detection methods by making as few restrictions and assumptions as possible. We fundamentally analyze the wormhole problem using a topology methodology and propose an effective distributed approach, which relies solely on network connectivity information, without any requirements on special hardware devices or any rigorous assumptions on network properties. We formally prove the correctness of this design in continuous geometric domains and extend it into discrete domains. We evaluate its performance through extensive simulations.