A Distributed Approach for Hidden Wormhole Detection with Neighborhood Information

Wang, Yun; Zhang, Zhongke; Wu, Jie

doi:10.1109/nas.2010.22

Cited by 13 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(1) Search on ordinary node abnormal topology Yun Wang et al [9] presented that the normal network had normal topology. In normal networks, the two-hop neighbors had only up to two common one hop neighbors.…”

Section: Abnormal Topology Searchesmentioning

confidence: 99%

Research on Wormhole Attack Detection Algorithm in Space Information Networks

Geng¹,

Zhang²,

Zhang³

et al. 2016

IJSIA

View full text Add to dashboard Cite

show abstract

Section: Abnormal Topology Searchesmentioning

confidence: 99%

Research on Wormhole Attack Detection Algorithm in Space Information Networks

Geng¹,

Zhang²,

Zhang³

et al. 2016

IJSIA

View full text Add to dashboard Cite

show abstract

“…UDGs have been extensively employed to create an idealized communication model for a multi-hop wireless network [14,20,25]. In UDGs, each node can be modelled as a disk of unit radius in a plane.…”

Section: Unit Disk Graphmentioning

confidence: 99%

“…The other unique characteristic of a wormhole link is that it abnormally increases the node's neighbourhood, and this feature is being exploited in [8,[14][15][16] to detect hidden wormhole. Let W 1 be a wormhole node that shares an out-of-band channel with another wormhole node W 2 .…”

Section: Introductionmentioning

confidence: 99%

WRSR: wormhole-resistant secure routing for wireless mesh networks

Matam

Tripathy

2013

J Wireless Com Network

View full text Add to dashboard Cite

Wormhole attack is one of the most severe security threats in wireless mesh network that can disrupt majority of routing communications, when strategically placed. At the same time, most of the existing wormhole defence mechanisms are not secure against wormhole attacks that are launched in participation mode. In this paper, we propose WRSR, a wormhole-resistant secure routing algorithm that detects the presence of wormhole during route discovery process and quarantines it. Unlike other existing schemes that initiate wormhole detection process after observing packet loss, WRSR identifies route requests traversing a wormhole and prevents such routes from being established. WRSR uses unit disk graph model to determine the necessary and sufficient condition for identifying a wormhole-free path. The most attractive features of the WRSR include its ability to defend against all forms of wormhole (hidden and Byzantine) attacks without relying on any extra hardware like global positioning system, synchronized clocks or timing information, and computational intensive traditional cryptographic mechanisms.

show abstract

“…Based on this information, each node finds the locations of some affected regions caused by wormholes and stop forwarding packets which came from those regions to isolate the wormhole (Nasipuri et al, 2001;Pirzada and McDonald, 2004). The distribution wormhole detection algorithm can be further classified into two approaches, namely, non-routing neighboring monitoring based approach (Huang and Lee, 2003) where each node monitors the topology structure of its neighbors (Wang et al, 2010;Maheshwari et al, 2007), or the inputs and outputs data flows (Khalil et al, 2005;2008) and routing receiver monitoring based approach where a data packet is monitored by the nodes in its routine. The typical distributed approaches are packet leashes (Hu et al, 2003;, TESLA with Instant Key-disclosure (Perrig et al, 2000) and mutual authentication with distancebounding (Liu et al, 2005;Du et al, 2006).…”

Section: Jcsmentioning

confidence: 99%

“…Figure 3 depicts the wormholes detection and isolation process. Wang et al (2010) proposed a similar wormhole detection and isolation approach. The proposed approach is mainly based on the following corollary: If there exist three mutually non-one-hop neighbor nodes in the intersection area of the two-hop neighbor sets of the nodes p and q, then p and q are certainly affected by a wormhole.…”

Section: Distributed Wormhole Detectionmentioning

confidence: 99%

Performance Evaluation of Wormhole Security Approaches for Ad-Hoc Networks

Hababeh

Khalil²,

Khreishah

et al. 2013

Journal of Computer Science

View full text Add to dashboard Cite

Ad-hoc networks are talented but are exposed to the risk of wormhole attacks. However, a wormhole attack can be mounted easily and forms stern menaces in networks, particularly against various ad-hoc wireless networks. The Wormhole attack distorts the network topology and decrease the network systems performance. Therefore, identifying the possibility of wormhole attacks and recognizing techniques to defend them are central to the security of wireless networks as a whole. In this study, we will summarize state of the art wormhole defense approaches, categories most of the existing typical approaches and discuss both the advantages and disadvantages of these methods. We will also point out some unfulfilled areas in the wormhole problem and provide some directions for future exploring.

show abstract

A Distributed Approach for Hidden Wormhole Detection with Neighborhood Information

Cited by 13 publications

References 19 publications

Research on Wormhole Attack Detection Algorithm in Space Information Networks

Research on Wormhole Attack Detection Algorithm in Space Information Networks

WRSR: wormhole-resistant secure routing for wireless mesh networks

Performance Evaluation of Wormhole Security Approaches for Ad-Hoc Networks

Contact Info

Product

Resources

About