Wormhole attacks can destabilize or disable wireless sensor networks. In a typical wormhole attack, the attacker receives packets at one point in the network, forwards them through a wired or wireless link with less latency than the network links, and relays them to another point in the network. We first propose a centralized algorithm to detect wormholes and show its correctness rigorously. Fo...

The switching scheme of a point-to-point network determines how packets flow through each node, and is a primary element in determining the networks performance. In this paper, we present and evaluate a new switching scheme called hybrid switching. Hybrid switching dynamically combines both virtual cut-through and wormhole switching to provide higher achievable throughput than wormhole alone, w...

A new approach to the design of collective communication operations in wormhole-routed mesh networks is described. The approach extends the concept of dominating sets in graph theory by accounting for the relative distance-insensitivity of the wormhole switching strategy and by taking advantage of a multi-port communication architecture, which allows each node to simultaneously transmit message...

The wormhole attack sniffs packets in one point in the network, tunnels them through a wired or wireless link to another point to cause severe influence on the localization process or routing process in the network. In this paper, we analyze the impact of the wormhole attack on the localization in wireless sensor networks and we propose a wormhole attack resistant secure localization scheme. Th...

It is shown that the event horizon of 4D black hole or ds2 = 0 surfaces of multidimensional wormhole-like solutions reduce the amount of information necessary for determining the whole spacetime and hence satisfy the Holography principle. This leads to the fact that by matching two metrics on a ds2 = 0 surface (an event horizon for 4D black holes) we can match only the metric components but not...

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...

Over the recent years, a great deal of effort has been devoted towards the development of analytical models for wormhole-routed networks. However, most of these models employ routers with negligible flit buffers. As a consequence, they do not adequately capture the performance behaviour of actual routers, which are often equipped with extended buffers which can hold more than one message flit. ...

The mobile adhoc networks, is the decentralized type of network in which mobile nodes can join or leave the network when they want. The secure and shortest path from source to destination will be selected on the basis of hop count and sequence number. The selected path must have minimum hop count and maximum sequence number. When the malicious node enters the network it leads to trigger wormhol...

The recent advancements in the wireless technology and their wide-spread deployment have made remarkable enhancements in efficiency in the corporate and industrial and Military sectors The increasing popularity and usage of wireless technology is creating a need for more secure wireless Ad hoc networks. This paper aims researched and developed a new protocol that prevents wormhole attacks on a ...

SUMMARY This paper presents the results of a simulation study of blocking and non-blocking switching for hierarchical ring networks. The switching techniques include wormhole, virtual cut-through, and slotted ring. We conclude that slotted ring network performs better than the more popular wormhole and virtual cut-through networks. We also show that the size of the node buuers is an important p...